order statistic tree
order statistic tree noun: a variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree).
Noun
order statistic tree (plural order statistic trees)
- A variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree).
Forms of order statistic tree
| plural | order statistic trees |
|---|
Questions about order statistic tree
- What does order statistic tree mean?
- Order statistic tree means a variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree).
- What part of speech is order statistic tree?
- Order statistic tree is a noun.
- What is the plural of order statistic tree?
- The plural of order statistic tree is order statistic trees.
Words near order statistic tree in the dictionary
Source and license
Adapted from Wiktionary: order statistic 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: “order statistic tree.” Word.ws, https://word.ws/order_statistic_tree. Based on Wiktionary, CC BY-SA 4.0.