(Solved) : Part 1 Implement Class Avltree Generates Avl Tree Objects Class Must Contain Following Met Q37352600 . . .
Part I 1. Implement a class AVLTree that generates AVL tree objects. The class must contain the following methods: Instance Methods Constructors: (i) AVLTree() -default constructor initializes an empty tree (ii) AVLTree (Comparable[] values)-overloaded constructor builds an AVL tree using the array values Setters: (i) void add (Comparable e) adds an object into the AVL tree into a position that maintains the BST property. Performs the necessary rotations to rebalance any imbalances e Getters: (i) boolean find(Comparable value) returns true if value is in the tree, false otherwise (ii) String toString) returns a string representation of the tree. Elements are listed using post-order traversa Helper Methods (i) void rotateRight (Node n) performs a right-rotation on node n. (ii) void rotateLeft (Node n) – performs a left-rotation on node n. (iii) înt diff (Node n) -cornputes the difference in heights of the right and left subtrees of node n. (iv) int height (Node n) computes the height of a subtree rooted at node n Inner Classes (i) class Node blueprint for a node with Comparable value, and references to right and left child nodes Part II 1. Construct an AVL tree using the array [14, 17, 11, 7, 53, 4, 13, 8] 2. Print the tree. 3. Print the height of the tree. 4. Print the difference at each node 5. Find values 1 and 4 in the tree. 6. What is the worst-case rumning time of determining whether an element is in the tree? Justify your answer Show transcribed image text
Expert Answer
Answer to Part 1 Implement Class Avltree Generates Avl Tree Objects Class Must Contain Following Met Q37352600 . . .
OR