How do I implement an AVL tree in Java? Please see screenshot.

For this assignment, you will be implementing a basic AVL tree. AVL trees are an important sub-class of binary search trees (BSTs) since they guarantee search times of O(log n) for any arrangement of input data (normal BSTs can do as poorly as O(n) if sorted data is put into the tree) Data Structures The tree node should be of the following type Public class AVLNode Int data; AVLNode left AVLNode right You have to perform three operations on the AVL tree Insert a node into the AVL tree handling all four cases of unbalanced insertions with the following rotations 1. 2. 3. 4. Right Rotation Left Rotation Left Right Double Rotation Right Left Double Rotation Delete a node from the AVL tree by handling the following cases of unbalanced tree, in addition to the cases alreadv handled for insertion: 1. 2. Case 5: Problem is in both the LL and LR subtrees of the parent Case 6: Problem is in both the RL and RR subtrees of the parent. Print: This function should begin by printing a small header containing the size of the tree. Then it should perform an InOrder traversal of the tree, printing out each element as it traverses the tree