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:
“Language is conceived in sin and science is its redemption.”
—Willard Van Orman Quine (b. 1908)
“a big picture of K. Marx with an axe,
“Where I cut off one it will never grow again.”
O Karl would it were true
I’d put my saw to work for you
& the wicked social tree would fall right down.”
—Gary Snyder (b. 1930)