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. Let us build a balanced binary search tree with names of the instructors. First, we add Kr (Kreinovich), then Ki (Kiekintveld), then G (Gallegos) and finally R (Roy). Show, step by step, how this tree will be formed. Do not forget to balance if necessary.
3. Draw how the list consisting of Kr, Ki, G, and Rwill be represented in a doubly linked list (no code is needed). Name one advantage of a doubly linked list.