Balancing an AVL Tree In a previous POTD, we were able to identify the deepest nodes that were unbalanced in an AVL tree. Nowit is time for you to actually balance them!
Your task is to implement the following function
balanceTree(TreeNodex& subroot) Returns which rotation type to use
A RotationType, which is defined in the TreeNode. h is simply an enumeration, which can take on the values:
right
left
rightLeft
leftRight
You are given the following helper functions
leftHeavy(const TreeNode* subroot) Returns true iff the right subtree is higher
rightHeavy(const TreeNode* subroot) Returns true iff the left subtree is higher
getHeight (const TreeNodex subroot) Returns the height of the given subtree
printTreePre0rder(const TreeNode* subroot) Prints the tree in pre order traversal