MCS-177, Intro. to Computer Science I, Fall 2003 
Homework Assignment 8
Due: Wednesday, May 7

  1. Do exercise 8.4 on page 220.
  2. (15 points) Do exercises 8.6 and 8.7 on page 220.  Then combine them with  the appropriate tree-traversal procedure to write a procedure that takes a (unsorted) list of numbers and sorts it by first putting the numbers into a binary search tree and then converting that tree to a sorted list of numbers.
  3. Do exercise 8.30 on pages 239-240.
  4. (15 point) Do exercises 8.8 and 8.9 on page 222.

MCS 177 homepage