Van Emde Boas Tree

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:

    Mrs. Van Hopper: Most girls would give their eyes for a chance to see Monte.
    Maxim de Winter: Wouldn’t that rather defeat the purpose?
    Robert E. Sherwood (1896–1955)

    A single soldier does not make a general, just as a single tree does not make a forest.
    Chinese proverb.