Write the AVLTree class where the test cases will check insert, delete and preorder member functions for your class. Important note for delete: select the minimum of the right Check the test cases. For example: Test Result AVL Tree tree = new AVL Tree(): 5 1 10 tree.insert(1); tree.insert(5); tree.insert(10); tree.preorder(); AVL Tree tree = new AVLTree(): 15 10 75 tree.insert(75); 15 10 4 75 tree.insert(15); tree.insert(10): tree.preorder(); System.out.println(); tree.insert(4); tree.preorder(); AVL Tree tree = new AVL Tree(); 15 10 4 12 75 tree.insert(75); 10 4 75 12 tree.insert(15); tree.insert(10); tree.insert(4): tree.insert(12); tree.preorder(); tree.delete(15); System.out.println(); tree.preorder(); Write the AVLTree class where the test cases will check insert, delete and preorder member functions for your class. Important note for delete: select the minimum of the right Check the test cases. For example: a Test Result AVL Tree tree = new AVL Tree(): 5 1 10 tree.insert(1); tree.insert(5): tree.insert(10); tree.preorder(); Data (Jawa code AVL Tree tree = new AVLTree(): 15 10 75 tree.insert(75); 15 10 4 75 tree.insert(15); tree.insert(10); tree.preorder(); System.out.println(); tree.insert(4); tree.preorder(); AVL Tree tree = new AVLTree(); 15 10 4 12 75 tree.insert(75); 10 4 75 12 tree.insert (15); tree.insert(10); tree, insert (4): tree.insert(12); tree.preorder(); tree. delete(15); System.out.println(); tree.preorder(); d on * Eclipse