**Name:** ___________________________________________________

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 N (Neith) arrives at the queue, then A (Alexis) follows, then N is served, then Al (Alexandra) and R (Ricardo) join the queue.

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