3.Next

A van Emde Boas tree , also known as a vEB tree or van Emde Boas priority queue, is a tree data structure which implements an associative array with -bit integer keys. It was invented by a team led by Dutch computer scientist Peter van Emde Boas in 1975. It performs all operations in time (assuming that an bit operation can be performed in constant time), or equivalently in time, where is

3.Next