Randomized Bottom-up Rebalancing Algorithms for Binary Search Trees

Simple randomized bottom-up rebalancing algorithms for binary search trees can achieve logarithmic expected depth for some insertion sequences, but fail to achieve balanced trees for other simple sequences.