BstRemove removes target from subtree tree, returning the new root of the subtree.

BstRemove removes target from subtree tree, returning the new root of the subtree.

DigLeft digs for smallest values in the subtree, returning the node as well as the height to that node.

DigRight digs for smallest values in the subtree, returning the node as well as the height to that node.

Bst is BST implementation with nodeWrapper as node.

BstCmp is for types with Cmp(T) int methods, e.g.

Heap is a binary heap implementation backed by Go slice.

BinaryTree have extra methods to work with nodes.

BinaryTreeBasic is basic, minimal binary tree with node type NODE.