Definitions from Wiktionary (van Emde Boas tree)
▸ noun: (computer science) A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional to the log of the size of its largest element, or equivalently with an upper bound equal to the logarithm of 2 multiplied by m.
▸ Words similar to Van Emde Boas tree
▸ Usage examples for Van Emde Boas tree
▸ Idioms related to Van Emde Boas tree
▸ Wikipedia articles (New!)
▸ Words that often appear near Van Emde Boas tree
▸ Rhymes of Van Emde Boas tree
▸ Invented words related to Van Emde Boas tree
▸ noun: (computer science) A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional to the log of the size of its largest element, or equivalently with an upper bound equal to the logarithm of 2 multiplied by m.
Similar:
B-tree,
AA tree,
red-black tree,
AVL tree,
link/cut tree,
treelist,
Merkle tree,
trie,
tree,
splay tree,
more...
▸ Words similar to Van Emde Boas tree
▸ Usage examples for Van Emde Boas tree
▸ Idioms related to Van Emde Boas tree
▸ Wikipedia articles (New!)
▸ Words that often appear near Van Emde Boas tree
▸ Rhymes of Van Emde Boas tree
▸ Invented words related to Van Emde Boas tree