Due at the start of class on Wednesday October 19.
1. Write both recursive and non-recursive pseudo-code
procedures to reverse a singly-linked list in O(n) time. You
need not preserve the original list -- that is, each procedure
should transform the list into its reverse.
2. 3.24 from the text
3. 4.5 from the text
4. 4.8 from the text
5. 4.9a from the text