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:
“There is but one Paris and however hard living may be here, and if it became worse and harder even—the French air clears up the brain and does good—a world of good.”
—Vincent Van Gogh (1853–1890)
“Go to the adolescent who are smothered in family—
Oh how hideous it is
To see three generations of one house gathered together!
It is like an old tree with shoots,
And with some branches rotted and falling.”
—Ezra Pound (1885–1972)