BinaryTree

Last edit September 14, 2007
A BinaryTree is a tree with zero or two branches from each node. Binary means some operations are of order O(log n).

Only if balanced.

For many variations of BinaryTrees, see DataStructures.
CategoryDataStructure