[SOLVED] Comp210 – avl tree

Your task in A7 is to implement an AVL tree as an implementation of the interface SelfBalancingTree.
A skeleton AVLTree class has been provided. You must at least provide a constructor that takes no arguments and creates an empty AVLTree. You can either use a null element value to indicate that a tree is empty or explicitly keep track of whether a tree is empty with a boolean field. You can assume that null is not otherwise a valid value for inserting into a tree as an element.
The skeleton also declares private rotateLeft and rotateRight methods. You should provide the code to implement these operations and then use them as necessary in your implementation of insert and remove.