Consider two examples: the recursive binary search, and the tower of Hanoi problem. Draw the tree of recursive calls for both problems, and compare their efficiencies.