Van Emde Boas tree

Van Emde Boas tree (or Van Emde Boas priority queue or vEB tree) is a tree data structure which implements an associative array with m-bit integer keys. It performs all operations (insert, delete, lookup, maximum, minimum, successor and predecessor) in O(log log M) time, where M is the maximum number of elements that can be stored in the tree.

Read this article to understand Van Emde Boas tree in depth

Have a doubt or thought? Join the discussion now

This is a companion discussion topic for the original entry at