I want to implement Symbol table ADT using AVL tree. I am working on java. Since its related to BST i have idea but i dont know how to implement the AVL using rotation and balancing. Can you help implementing AVL tree in Java please?

2.2 Updating N in rotation methods We use the left and right tree rotation operations described in class, but they need to account for the change in height. Make sure your rotate methods correctly update the height of affected nodes, in addition to changing the structure of the tree 2.3 AVL Insert and remove You must provide working AVL insert and remove methods as part of your submission. That is, in addition to adding and removing nodes to maintain the BST search property, your insert and remove must check for imbalances in the tree and correct them as part of their operation. Failure to rebalance the tree, or rebalancing using some other mechanism, wil both be considered wrong. Insert and remove methods that fail in some cases but not others may receive partial credit depending on the severity and frequency of the failure. 3 Implementation Details Create the class AVLSymbolTable which implements the SymbolTable interface: public class AVLSymbolTableck extends Comparablek>, v> implements SymbolTable This class should also provide the serialize method (see Section 3.3 below). The Node subclass will have an added height field to track the height of the node; take care to properly update this value as described above