Use java please

2. (10) What is an AVL tree ? What are its advantages and disadvantages over BST? Suppose you have an initial BST tree below. 75 90 30 Insert 45, Insert 35, Delete 30, Insert 50, Insert 95, Insert 100, Insert 97 Delete 55 (15) Draw the tree after the performing the operations listed above (use successor values in case ot deletions) 3. 4. (10) List the resulting BST tree in Preorder