Problem set week 2

The idea with this problem set is that you should practice on the following things:

• The list, stack and queue ADTs, and some data structures implementing these ADTs.

• Pointer juggling.

• Implementing a data structure by making use of an ADT.

Exercises:

• 3.25a.

• 3.29. (Note that recursion typically makes use of stack space.)

• 3.33.

Exercise numbers refer to the course book.