Definitions from Wiktionary (order statistic tree)

▸ noun:  (computing theory) 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).


▸ Words similar to order statistic tree
▸ Usage examples for order statistic tree

▸ Idioms related to order statistic tree
▸ Wikipedia articles (New!)
▸ Words that often appear near order statistic tree
▸ Rhymes of order statistic tree

▸ Invented words related to order statistic tree