1. Are the following topics covered in the portion of the chapter that you were supposed to read for today's class? mark Y (yes) or N (no) for each topic:
2. Show, step by step, what will happen if we start with an empty binary search tree and add, one by one, the following elements: 4, 19, 20, and 11. Do not forget to balance the tree every time such a balancing is needed.
3. For extra credit: write a recursive method that adds a given element to a binary search tree; no balancing is needed in this code.