ne representative example is shown for each one.  I encourage you to make
up more problems and see if you can solve them (and give them to your friends
and see if your answers match).

1.  Draw the linked list after the following operations:
add_head(list,5);
add_head(list,9);
add_tail(list,12);
add_head(list,3);
add_sorted(list,15); // add in sorted order
add_sorted(list,0);
add_sorted(list,7);

2. Draw the stack after the following operations:
push(stack,3);
push(stack,5);
pop(stack);
push(stack,7);
push(stack,1);
pop(stack);

3.  Draw the queue after the following operations:
enqueue(queue,3);
enqueue(queue,5);
enqueue(queue,7);
dequeue(queue);
enqueue(queue,8);
dequeue(queue);
enqueue(queue,1);


One representative example is shown for each one.  I encourage you to make
up more problems and see if you can solve them (and give them to your friends
and see if your answers match).

1.  Draw the bst in two ways after the following sequence of operations:
First, draw the tree as a picture, as shown in class.
Then, draw the tree stored in an array, as it would be with the array
implementation of a binary tree.
insert(bst,5);
insert(bst,7);
insert(bst,3);
insert(bst,10);
insert(bst,1);
insert(bst,4);
remove(bst,7);
insert(bst,13);
insert(bst,8);
remove(bst,5);
insert(bst,25);
insert(bst,9);

2.  Draw the heap after the following sequence of operations:
insert(heap,5);
insert(heap,7);
insert(heap,3);
insert(heap,10);
insert(heap,1);
insert(heap,4);
remove(heap);
remove(heap);
insert(heap,8);