Try a few examples of five-entry binary search trees.