e/Exponential tree

Information
has gloss	eng: 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.
lexicalization	eng: exponential tree
instance of	(noun) a function in which an independent variable appears as an exponent exponential function, exponential

Media
media:img	ExponentialTree2.PNG