Successive Insertions and Deletions

We know that nearly balanced trees are best because find, insertion, and deletion all run in O(h), which is $O(\log n)$ if the tree isn't too stringy.

But, even if we start off with a nice balanced tree, it might not be balanced anymore after a sequence of insertions and deletions.

Sugar Pine : unbalanced Coulter Pine : balanced