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:
“Is not disease the rule of existence? There is not a lily pad floating on the river but has been riddled by insects. Almost every shrub and tree has its gall, oftentimes esteemed its chief ornament and hardly to be distinguished from the fruit. If misery loves company, misery has company enough. Now, at midsummer, find me a perfect leaf or fruit.”
—Henry David Thoreau (1817–1862)