Problem
1. How many tree links actually must be changed for a double rotation, and how many are actually changed in the implementation given?
2. Generate two random 32-node red-black trees, draw them (either by hand or with a program), and compare them with the unbalanced binary search trees built with the same keys.
3. Generate ten random 1000-node red-black trees. Compute the number of rotations required to build the trees and the average distance in them from the root to an external node. Discuss the results.