A balanced tree is a rooted tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of "much farther" and different amounts of work to keep them balanced. For an example, see binary tree.
This is version 4 of balanced tree, born on 2002-02-25, modified 2007-09-01.
Object id is 2706, canonical name is BalancedTree.
Accessed 12475 times total.
