Problem
1. Draw the top-down 2-3-4 tree built when the keys EASY QUESTION are inserted (in that order) into an initially empty tree.
2. Draw a red-black representation of the tree from the previous question.
3. Exactly what links are modified by split and rot ate when Z is inserted (after Y) into the example tree for this chapter?
4. Draw the red-black tree that results when the letters A through K are inserted in order, and describe what happens in general when keys are inserted into the trees in ascending order.