Problem
1. Draw the digital search tree that results when the keys EA S Y Q U E S T I O N are inserted in that order into an initially empty tree.
2. Generate a 1000 node digital search tree and compare its height and the number of nodes at each level against a standard binary search tree and a red-black tree (Chapter 15) built from the same keys.
3. Find a set of 12 keys that make a particularly badly balanced digital search .
4. Draw the radix search tree that results when the keys E AS Y Q U E S T I O N are inserted in that order into an initially empty tree.