Noun
order statistic tree (plural order statistic trees)
(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).