MCS-177, Intro. to Computer Science I, Fall 2008
Homework Assignment 8
Due: Wednesday, Dec. 3

  1. (10 points) Do exercise 8.2 on page 217.
  2. (10 points)  Do exercise 8.5 on page 220.  Don't use append.
  3. (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.  Be sure to answer all of the questions in 8.7.
  4. (15 points) Do exercises 8.8 and 8.9 on page 222.

MCS 177 homepage