Lab 9 - AVL Tree rotations
For this lab, you will implement the right and right-left rotations in
AVL.h, which is modified from BST.h from the book and
Lab 6. AVL.h already has the left and left-right
rotations defined, along with debugging statements to show you before and
after shots of the tree when doing rotations. Use
lab9main.cpp to test the rotations. Before you
define the right rotation, the only inserts that will work properly are
numbers in ascending order (e.g. 1, 2, 3, 4, 5) because that order of
insertion relies purely on left rotations.
Email your modified AVL.h file to me.