CS 14 - TreeMap

CS 14 TreeMap

Due Wednesday, August 11th @ 8pm

Your assignment is to implement a data structure that maps from strings to strings, like a dictionary. In a dictionary, you use a key (the word you are looking up) and are returned the value stored with that key (the definition.) STL has a map datatype that works for arbitrary types, but as we are just barely getting into templates, we will be doing this only with strings.

Details

You must implement the interface defined in treemap.h, and make sure that all of the behaviors of the program are implemented correctly. You may ADD to this interface, but you may not alter any functions. We will be testing your submission by compiling your treemap.cc with our main function and testing in our main function.

To get you started with testing, we are providing a main.cc that performs some extremely basic testing. It is highly recommended that you add additional test cases of your own.

Hints

Add more test cases and test as you go.
Writing "clearTree" and "copyTree" helpers will make your destructor, copy constructor, and assignment operator share the maximal amount of code
You will need to add a private helper function for any recursive calls on Node*'s.