A Van Emde Boas tree (or Van Emde Boas priority queue), also known as a vEB tree, is a tree data structure which implements an associative array with m-bit integer keys. It performs all operations in O(log m) time. Notice that m is the size of the keys — therefore O(log m) is O(log log n) in a tree where every key below n is set, exponentially better than a full self-balancing binary search tree. They also have good space efficiency when they contain a large number of elements, as discussed below. They were invented by a team led by Peter van Emde Boas in 1975.
Read more about Van Emde Boas Tree: Supported Operations, How It Works
Famous quotes containing the words van and/or tree:
“I know that Europe’s wonderful, yet something seems to lack;
The Past is too much with her, and the people looking back.”
—Henry Van Dyke (1852–1933)
“Here is a hero who did nothing but shake the tree as soon as the fruit was ripe. Does this seem to be too small a thing to you? Then take a good look at the tree he shook.”
—Friedrich Nietzsche (1844–1900)