bst

func (*Tree[K, V]) Find ¶

func (t *Tree[K, V]) Find(k K) (V, bool)

Find finds an element from the BST. The performance of the find operation highly depends on the order of insertion, as a BST isn't a balanced structure. In cases where the element is not present in the tree, a zero value with a `false` boolean will be returned.

func (*Tree[K, V]) Insert ¶

func (t *Tree[K, V]) Insert(key K, val V)

Insert adds an element to the BST.

func (*Tree[K, V]) Remove ¶

func (t *Tree[K, V]) Remove(k K) (V, bool)

Remove deletes an element from the BST. The performance of the delete operation highly depends on the order of insertion, as a BST isn't a balanced structure. In cases where the element is not present in the tree, a zero value with a `false` boolean will be returned. If the object is found, it is removed from the structure and returned.

func (*Tree[K, V]) Walk ¶

func (t *Tree[K, V]) Walk(fn func(K, V))