Robert E. Tarjan

Rank-Balanced Trees

2015 · ACM Transactions on Algorithms

Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and …