An exponential tree is almost identical to a binary search tree, with the exception that the dimension of the tree is not the same at all levels. In a normal binary search tree, each node has a dimension (d) of 1, and has 2d children. In an exponential tree, the dimension equals the depth of the node, with the root node having a d = 1. So the second level can hold two nodes, the third can hold eight nodes, the fourth 64 nodes, and so on.
Read more about Exponential Tree: Layout
Famous quotes containing the word tree:
“I have come to the conclusion that the closer people are to what may be called the front lines of government ... the easier it is to see the immediate underbrush, the individual tree trunks of the moment, and to forget the nobility the usefulness and the wide extent of the forest itself.... They forget that politics after all is only an instrument through which to achieve Government.”
—Franklin D. Roosevelt (1882–1945)