Review: Dynamic Order Statistics
l We’ve seen algorithms for finding the ith
element of an unordered set in O(n) time
l OS-Trees: a structure to support finding the ith
element of a dynamic set in O(lg n) time
n Support standard dynamic set operations
(Insert(), Delete(), Min(), Max(),
Succ(), Pred())
n Also support these order statistic operations:
void OS-Select(root, i);
int OS-Rank(x);