• have a thorough understanding of commonly used library data structures.
• understand the use of recursion in problem solving.

You are to write a RedBlackTreeSet that extends the AbstractSet class and implements the Set interface. Once your implementation is complete, you should benchmark it using the tests from Lab 4.

You are not required to provide full implementations for the following methods (they may just throw an appropriate exception):

• remove
• removeAll
• retainAll
• iterator

• You must make use of at least one recursive method.
• Methods that are not part of the Set interface should not be declared publicly.
• The toArray methods should return a sorted array.
• This webpage provides useful information on how to insert elements into a Red-Black tree.

Here is a template file to use as a starting point for this report.

Your report should include:

• Your reaction (a couple of paragraphs on what you learned and what you thought about while working on this assignment)
• A discussion of how you tested your class implementation to ensure that it is defect free.
• Results from the benchmarking test (discuss how this compares with the results from lab 4).
• The Documented source code for your program.
• Be sure to log the time you spend on this project in the FAST system.

As with any report you submit, correct spelling and grammar are required. In addition, your report should be submitted electronically following the Electronic submission guidelines. (You may wish to consult the XML help video and/or sample report before submitting your report.) Be sure to keep copies of all your files, in case something gets lost.

If you have any questions, consult your instructor.

This assignment was originally developed by Dr. Chris Taylor.

© 2001-2006 Dr. Christopher C. Taylor

Office: CC-36C

Phone: 277-7339