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:

- binary search trees
- heaps
- balanced trees
- hash tables

2. Let us assume that a queue of students is implemented as an array of size 3. Show, step-by-step, what will happen if first M (Melissa) arrives at the queue, then E (Elishiah) follows, then M is served, then A (Arturo) and K (Keicha) join the queue.

3. *For extra credit:* write codes for enqueue when the
queue is implemented as an array and as a linked list.