Implement Binary Search Tree Rotations

$13.$ To work on your tree rotation implementation, implement the method named to follow the rotation algorithm described in lecture. Your code for the method should be self$-$contained and not depend on any calls of methods from the class and do not subclass the class. Do not add or modify any of the fields of the class and do not subclass the class nor the inner class during this process. Since rotations re$-$arrange existing nodes rather than create new ones, also make sure that you are not instantiating any new node objects in your method.

$14.$ If you'd like you are welcome to make use of the method of the nested Node class, but you are not required to use this method. Make sure that the rotate method contains in$-$line comments that are sufficient to help an experienced programmer, such as one of your class mates or course staff, to read through your code and follow its steps.

$15.$ After you have implemented a first version, use your tests implemented in step $11$ to test and debug your implementation.