Design and write a complete test program to test if the AVLTree class in Listing 26.4 meets all requirements.

Listing

Transcribed Image Text:

1 public class TestAVLTree { public static void main(String[] args) { // Create an AVL tree AVLTree tree = new AVLTree<>(new Integer[]{25, 20, 5}); System.out.print("After inserting 25, 20, 5:"); printTree (tree); 3 4 8 tree.insert(34); tree.insert(50); System.out.print("\nAfter inserting 34, 50:"); printTree(tree); 10 11 12 13 14 tree.insert(30); System.out.print("\nAfter inserting 30"); printTree(tree); 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 tree.insert(10); System.out.print("\nAfter inserting 10"); printTree(tree); tree.delete(34); tree.delete(30); tree.delete(50); System.out.print("\nAfter removing 34, 30, 50:"); printTree(tree); tree.delete(5); System.out.print("\nAfter removing 5:"); printTree(tree); System.out.print("\nTraverse the elements in the tree: "); for (int e: tree) { System.out.print(e + " "); 34 35 36 37 38 public static void printTree(BST tree) { // Traverse tree System.out.print("\nInorder (sorted): "); tree.inorder); System.out.print("\nPostorder: "); tree.postorder(); System.out.print("\nPreorder: "); tree.preorder(); System.out.print("\nThe number of nodes is 39 40 41 41 43 44 45 + tree.getSize()); 46 nw3wmmmm