project 7 binary coding + extra credit

Project 7 - Extra Credit Programming and Algorithms II

CSCI 211, Spring 2018

No extra credit points will be given to late assignments (even if using late days). You must turn in the non-extra credit version (on time) in addition to the extra credit version.

Extra Credit

Finish P7 and pass all tests before considering the extra credit. Make sure you save a copy of your completely working program before you start the extra credit. The extra credit version must also pass all of the non-extra credit tests.

5 points: Implement a remove function:

remove<space><str>

If the string is in the tree and is removed, print nothing.

If the string is not in the tree, print the following to standard error: “<str> not in tree and cannot be removed.\n”

The remove function must reorganize the tree so that it remains a binary search tree. However, you cannot simply reorganize the entire tree like in the rebalance command. You must make minimal changes to the tree so it remains a binary search tree. This is difficult, you will need to find a description of the algorithm online.