Project 2

Due - Tuesday, March 7, 2006

Complete question 4.40 (Chapter 4) from the text book. You may use the BinarySearchTree implementation available from http://www.cs.fiu.edu/~weiss/dsaa_c++/code/. If you prefer to do this assignment in Java or another programming language, please come to speak with me about where you can find a basic BST implementation that you can modify.

Hint: you will need to use one or more additional data structures to solve this problem. You may use any of the other code available from the web page list above, or the STL, or the java.util libraries.

For this project, you must submit your completed code along with a short write-up (less than 1 page) proving your time bound.

Reminder: No part of your code may be copied from any other source. All code submitted must be original code written by you.

Sami Rollins