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:
““The tree of knowledge is not the tree of life!” And yet can we cast out of our spirits all the good or evil poured into them by so many learned generations? Ignorance cannot be learned.”
—Gérard De Nerval (1808–1855)