Lab 5: AVL Trees

To do the following excercises, first type into your terminal the following command: git clone https://github.com/Andre-Castro/cs14Spr17Week6. You should now see a folder with a single .h file and a single .o file.

Feel free to use the following site to double check the correctnes of your AVL Trees: Click me!

Exercise 1 - Remove

Make a function void remove(const string &); that removes the node with the specified value from the tree. Be sure to keep the properties of an balanced tree.

For example, in the following tree:

The removal of node f would look like:

And the subsequent remval of nodes e and g would look like:

For more help on AVL Tree deletions check out the following link: AVL Tree Deletions