School of Engineering and Applied Science
Department of Computer Science
CSci 133 -- Algorithms and Data Structures I
http://www.seas.gwu.edu/~csci133/spring04
Prof. Michael B. Feldman
mfeldman@gwu.edu

Project #6

Due Date: javadoc page(s), 5 PM, Monday, April 19, 2004
entire project: beginning of class, Wednesday,  April 28, 2004
This is a final deadline. NO projects can be accepted after this date!

This two-stage project depends mostly on Chapter 9 and Sections 10.1-10.3 of Lewis & Chase, Java Software Structures.

Develop and test a binary search tree (BST) implementation of a set. Once again, use the SetADT interface as a "contract". In your implementation, you must use the linked binary tree and BST classes from the textbook.

You should be able to reuse much (or all) of your testing plans and programs from earlier projects. If you do, you must submit them along with any new code you write.

(end of project)