search

Documentation

Index

• type BinaryTree
  • func (b *BinaryTree[T]) Delete(key T)
  • func (b *BinaryTree[T]) DeleteMin()
  • func (b *BinaryTree[T]) Get(key T) any
  • func (b *BinaryTree[T]) Keys(lowKey, highKey T) []T
  • func (b *BinaryTree[T]) Min() T
  • func (b *BinaryTree[T]) Print(w io.Writer)
  • func (b *BinaryTree[T]) Put(key T, value any)
  • func (b *BinaryTree[T]) Rank(key T) int
  • func (b *BinaryTree[T]) Size() int

Types

type BinaryTree

type BinaryTree[T constraints.Ordered] struct {
	// contains filtered or unexported fields
}

func (*BinaryTree[T]) Delete

func (b *BinaryTree[T]) Delete(key T)

func (*BinaryTree[T]) DeleteMin

func (b *BinaryTree[T]) DeleteMin()

func (*BinaryTree[T]) Get

func (b *BinaryTree[T]) Get(key T) any

func (*BinaryTree[T]) Keys

func (b *BinaryTree[T]) Keys(lowKey, highKey T) []T

func (*BinaryTree[T]) Min

func (b *BinaryTree[T]) Min() T

minimum key

func (*BinaryTree[T]) Print

func (b *BinaryTree[T]) Print(w io.Writer)

func (*BinaryTree[T]) Put

func (b *BinaryTree[T]) Put(key T, value any)

func (*BinaryTree[T]) Rank

func (b *BinaryTree[T]) Rank(key T) int

func (*BinaryTree[T]) Size

func (b *BinaryTree[T]) Size() int