Homework 2 Programming Part (25 points)

The directory redblacktree.tar contains three .java files with code to implement Red-Black Trees. You are to implement the insert, delete and search functions as outlined in lecture. You should not need to touch other parts of the code, although you will need to understand it. The code provides various functions for testing that your implementation is correct. In particular, the file RedBlackTreeTest.java is an example of a Java program that makes use of the class RedBlackTree.

Tips:

• If you can't download the files from this page, you can get them by logging into CDF and looking in /h/u1/bureshop/pub.
• Don't forget about the "NIL" nodes that appear at the bottom of Red-Black Trees. These are implemented here as nodes with key-value null (not to be confused with null nodes).

Submission Instructions: Please submit all files needed to compile your code by 6pm on Tuesday, June 29. You can submit from within your CDF account by using submit -c csc263h -a prog2 {filenames}. You can get more information about submit in the man page.