binary_search_tree

package
v0.0.0-...-6deb688 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Nov 1, 2023 License: Apache-2.0 Imports: 2 Imported by: 0

Documentation

Index

Constants

This section is empty.

Variables

View Source
var (
	ErrEmptyTree     = errors.New("empty tree")
	ErrValueNotFound = errors.New("value not found")
)

Functions

This section is empty.

Types

type BinarySearchTree

type BinarySearchTree[T cmp.Ordered] struct {
	// contains filtered or unexported fields
}

func NewBST

func NewBST[T cmp.Ordered]() *BinarySearchTree[T]

func (*BinarySearchTree[T]) Get

func (t *BinarySearchTree[T]) Get(value T) (*Node[T], error)

func (*BinarySearchTree[T]) Insert

func (t *BinarySearchTree[T]) Insert(value T)

func (*BinarySearchTree[T]) Max

func (t *BinarySearchTree[T]) Max() (T, error)

func (*BinarySearchTree[T]) Min

func (t *BinarySearchTree[T]) Min() (T, error)

func (*BinarySearchTree[T]) Remove

func (t *BinarySearchTree[T]) Remove(value T)

func (*BinarySearchTree[T]) TraverseInOrder

func (t *BinarySearchTree[T]) TraverseInOrder() []T

type Node

type Node[T cmp.Ordered] struct {
	// contains filtered or unexported fields
}

func NewNode

func NewNode[T cmp.Ordered](value T) *Node[T]

func (*Node[T]) Get

func (n *Node[T]) Get(value T) *Node[T]

func (*Node[T]) Insert

func (n *Node[T]) Insert(value T)

func (*Node[T]) Max

func (n *Node[T]) Max() T

func (*Node[T]) Min

func (n *Node[T]) Min() T

func (*Node[T]) TraverseInOrder

func (n *Node[T]) TraverseInOrder() []T

func (*Node[T]) Value

func (n *Node[T]) Value() T

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL