skew

README

Skew Priority Queue

Implementation Notes

Nodes contain the following:

• A key k, where k ∈ ℝ
• A pointer to a value
• A pointer to the left node
• A pointer to the right node

Documentation

Index

• type Tree
  • func FindMin[K cmp.Ordered, V any](t *Tree[K, V]) *Tree[K, V]
  • func Insert[K cmp.Ordered, V any](t *Tree[K, V], new *Tree[K, V]) *Tree[K, V]
  • func Meld[K cmp.Ordered, V any](a, b *Tree[K, V]) *Tree[K, V]
  • func NewTree[K cmp.Ordered, V any](key K, value V) *Tree[K, V]
  • func RemoveMin[K cmp.Ordered, V any](t *Tree[K, V]) *Tree[K, V]
  • func (t *Tree[K, V]) Key() K
  • func (t *Tree[K, V]) Value() V

Types

type Tree

type Tree[K cmp.Ordered, V any] struct {
	// contains filtered or unexported fields
}

func FindMin

func FindMin[K cmp.Ordered, V any](t *Tree[K, V]) *Tree[K, V]

func Insert

func Insert[K cmp.Ordered, V any](t *Tree[K, V], new *Tree[K, V]) *Tree[K, V]

func Meld

func Meld[K cmp.Ordered, V any](a, b *Tree[K, V]) *Tree[K, V]

func NewTree

func NewTree[K cmp.Ordered, V any](key K, value V) *Tree[K, V]

func RemoveMin

func RemoveMin[K cmp.Ordered, V any](t *Tree[K, V]) *Tree[K, V]

func (*Tree[K, V]) Key

func (t *Tree[K, V]) Key() K

func (*Tree[K, V]) Value

func (t *Tree[K, V]) Value() V