All of the previous answers to this question have been incorrect so please don't copy and paste the previous results/ans

[answerhappygod]

All of the previous answers to this question have been incorrectso please don't copy and paste the previous results/answers, thankyou!
I just specifically need help on the leftRotate and FullLeft asI don't understand what the difference is in a binary searchtree.
There are plenty of examples of Binary Search Tree classeswritten in Java available on the Internet. Find one. Eitherdownload or copy and paste the code into an appropriately namedJava class file. Compile that file.Then, create the class BinarySrcTree, which will inherit from theclass you downloaded from the Internet. Place a comment in theclass that states where you obtained your base class (URL or Webpage or site name). You will then overwrite or overload to createthe following methods:
 leftRotate(Node n) : performs a single left rotation on thespecified Node
 fullLeft(Node n): performs a full left rotation on thespecified Node
 rightRotate(Node n) : performs a single right rotation on thespecified Node
 fullRight(Node n): performs a full right rotation on thespecifid Node
 int balance() : returns whether a tree is balanced or not. Ifit is balanced, it returns a 0. If the left subtree is unbalanced,it returns a negative value, and the actual value will be the nodenumber (counting from the root) of the unbalanced node. If theright subtree is unbalanced, it returns a positive value,calculated the same way.