A tree is defined as a data structure in which access always begins from the "root node," where a "node" is simply a reference point in the tree, and the "root node" is the only node that has no parent. The end-points of the tree comprise nodes that have no "child nodes," and these are called the "leaves"; nodes that do have child nodes are called "interior nodes." Interior nodes have child nodes attached to them, and a node that has child nodes is called the parent of those nodes. Trees are recursive in that any node can be considered to be the root of all nodes below it. The nodes below a node are called the "subtree" of that node.

A balanced tree is a special kind of tree where all the leaves are all a similar distance from the root node; that is, no...