bst

package

v0.4.0 Latest Latest Go to latest Published: Dec 30, 2024 License: MIT Imports: 3 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type BST[T ordered, M any] struct {
	Root Node[T, M]
}

func NewBST[T ordered, M any](value T, meta M) BST[T, M]

func (this *BST[T, M]) Add(value T, meta M)

func (this *BST[T, M]) InOrderSeq() iter.Seq[*Node[T, M]]

func (this *BST[T, M]) Max() *Node[T, M]

func (this *BST[T, M]) Min() *Node[T, M]

func (this BST[T, M]) NewBalanced() BST[T, M]

func (this *BST[T, M]) PostOrderSeq() iter.Seq[*Node[T, M]]

func (this *BST[T, M]) PreOrderSeq() iter.Seq[*Node[T, M]]

func (this *BST[T, M]) Remove(value T) (Node[T, M], bool)

func (this *BST[T, M]) Search(value T) (*Node[T, M], bool)

type Node[T ordered, M any] struct {
	Value T
	Meta  M
	Left  *Node[T, M]
	Right *Node[T, M]
}

func FromSortedList[T ordered, M any](values []NodeValue[T, M]) Node[T, M]

func NewNode[T ordered, M any](value T, meta M) Node[T, M]

func (this *Node[T, M]) Add(value T, meta M)

func (this *Node[T, M]) InOrderSeq() iter.Seq[*Node[T, M]]

func (this *Node[T, M]) Max() *Node[T, M]

func (this *Node[T, M]) Min() *Node[T, M]

func (this *Node[T, M]) PostOrderSeq() iter.Seq[*Node[T, M]]

func (this *Node[T, M]) PreOrderSeq() iter.Seq[*Node[T, M]]

func (this *Node[T, M]) Search(value T) (*Node[T, M], bool)

type NodeValue[T ordered, M any] struct {
	Value T
	Meta  M
}