Versions in this module Expand all Collapse all v0 v0.1.1 May 29, 2024 v0.1.0 May 29, 2024 Changes in this version + type BinaryTree struct + func New[Ord constraints.Ordered, T any]() *BinaryTree[Ord, T] + func (st *BinaryTree[Ord, T]) Del(key Ord) + func (st *BinaryTree[Ord, T]) Get(key Ord) (T, bool) + func (st *BinaryTree[Ord, T]) GetMax() T + func (st *BinaryTree[Ord, T]) GetMin() T + func (st *BinaryTree[Ord, T]) InOrder(fn func(*Node[Ord, T]) bool) + func (st *BinaryTree[Ord, T]) LevelOrder(fn func(*Node[Ord, T]) bool) + func (st *BinaryTree[Ord, T]) PreOrder(fn func(*Node[Ord, T]) bool) + func (st *BinaryTree[Ord, T]) Put(key Ord, val T) + func (st *BinaryTree[Ord, T]) ReverseOrder(fn func(*Node[Ord, T]) bool) + func (st *BinaryTree[Ord, T]) Size() uint + func (st *BinaryTree[Ord, T]) SufOrder(fn func(*Node[Ord, T]) bool) + type Node struct + func (n *Node[Ord, T]) IsNil() bool + func (n *Node[Ord, T]) Key() Ord + func (n *Node[Ord, T]) Left() search.ITraversal + func (n *Node[Ord, T]) Right() search.ITraversal + func (n *Node[Ord, T]) String() string
Go to main page