order statistic trees

A form of order statistic tree — 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).

Meanings

noun
  1. pluralplural of order statistic tree
Cite this entry
APA

order statistic trees. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/order%20statistic%20trees

MLA

“order statistic trees.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/order%20statistic%20trees. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “order statistic trees,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/order%20statistic%20trees.

Source: order statistic trees on Wiktionary, CC BY-SA 4.0.