IN C++

For this assignment, you are to implement the AVL Tree, given a complete implementation of the BST Tree. You are required to implement the algorithms listed on the next page and modify the Insert/Delete code to use these algorithms properly.

Some hints:

1.Implement Get Height and Balance Factor first and test it.

2. Implement the Left Single and Right Single next, and then implement the Balance Tree function to only perform single rotations. Test your progress in your own test code.

3. Then implement the double rotations by calling the single rotations properly. Complete the Balance Tree

after coding the double rotations and test it in your own test code.

4.Finally, use the test code I provided to ensure the tree is balancing properly.