Problem
1. Suppose that we have an estimate ahead of time of how often search keys are to be accessed in a binary tree. Should the keys be inserted into the tree in increasing or decreasing order of likely frequency of access? Why?
2. Modify binary tree search so that it keeps equal keys together in the tree. (If any other nodes in the tree have the same key as any given node, then either its parent or one of its children should have an equal key.)