Problem
1. Draw an example red-black tree that is not an AVL tree.
2. Consider a tree T storing 100,000 entries. What is the worstcase height of T in the following cases?
a. T is an AVL tree.
b. T is a (2,4) tree.
c. T is a red-black tree.
d. T is a splay tree.
e. T is a binary search tree.