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

(15 points) Do exercises 7.16 and 7.17 on page 186. Be sure to describe at least three ways of representing the table on page 185, and discuss the relative advantages and disadvantages of each. Build an appropriate abstract data type for the representation you decide to use in 7.17.
Do exercise 8.4 on page 220.
(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.
Do exercises 8.17 on page 229