Successive Insertions and Deletions

We know that nearly balanced trees are best because finding an element, insertion, and deletion, all run in O(h), which is 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.

Next time: look at a way of implementing these operations so that the tree stays balanced (on average).