van Emde Boas tree
van Emde Boas tree noun: 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.
Noun
van Emde Boas tree (plural van Emde Boas trees)
- 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.
Forms of van Emde Boas tree
| plural | van Emde Boas trees |
|---|
Origin of van Emde Boas tree
Named after Peter van Emde Boas.
Questions about van Emde Boas tree
- What does van Emde Boas tree mean?
- Van Emde Boas tree means 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.
- What part of speech is van Emde Boas tree?
- Van Emde Boas tree is a noun.
- What is the plural of van Emde Boas tree?
- The plural of van Emde Boas tree is van Emde Boas trees.
Words near van Emde Boas tree in the dictionary
Source and license
Adapted from Wiktionary: van Emde Boas tree (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “van Emde Boas tree.” Word.ws, https://word.ws/van_emde_boas_tree. Based on Wiktionary, CC BY-SA 4.0.
