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:
“The legend of Felix is ended, the toiling of Felix is done;
The Master has paid him his wages, the goal of his journey is won;
He rests, but he never is idle; a thousand years pass like a day,
In the glad surprise of Paradise where work is sweeter than play.”
—Henry Van Dyke (1852–1933)
“There is something singularly grand and impressive in the sound of a tree falling in a perfectly calm night like this, as if the agencies which overthrow it did not need to be excited, but worked with a subtle, deliberate, and conscious force, like a boa-constrictor, and more effectively then than even in a windy day.”
—Henry David Thoreau (1817–1862)