Problem
1. How many different binary search trees can store the keys {1,2,3}?
2. How many different binary search trees can store the keys {1,2,3,4}?
3. Insert, into an empty binary search tree, entries with keys 30, 40, 24, 58, 48, 26, 11, 13 (in this order). Draw the tree after each insertion.