Exponential tree

This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. Please help to improve this article by introducing more precise citations. (March 2021) (Learn how and when to remove this template message)

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 2^d 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 four nodes, the third can hold eight nodes, the fourth 16 nodes, and so on.

External links[]

• Faster deterministic sorting and searching in linear space (Original paper from '95)

This algorithms or data structures-related article is a stub. You can help Wikipedia by .

• v
• t