Course: Data Structure and Algorithms Language: Java Topic: AVL Tree You have to solve this question prperly step by step and complete. An AVL tree may become unbalanced when a node is inserted. In general, what is the maximum number of rotations that must be performed to rebalance the tree due to an insertion? Explain your answer.

3. Given the binary tree, please describe the Inorder traversal algorithm and output the binary tree's Inorder traversal sequence. 10 1 40 1 20 1 1 50 30

PYTHON PROGRAMMING ONLY (BINARY SEARCH TREE)  MY CODE IS NOT WORKING PROPERLY  (IM USING PYCHARM AS MY IDE) 1. Generate a random binary tree with 12 elements. You can leave the perfect option asFalse.2. Print the tree.3. Test the tree properties. The documentation uses the assert statement. 4. Create a binary search tree manually (not using the bst function, but instead buildingit by hand. Put at least 8 elements in it.5. Print this tree.6. Print the values in the tree in several orders (inorder, postorder, preorder, etc.) CODE BELOW from binarytree import build, bst, Node# Generate a random binary tree with 12 elementsrandom_tree = build(height=3, min_value=1, max_value=100)# Print the treeprint("Random binary tree:")print(random_tree)# Test the tree propertiesassert random_tree.is_binary_treeassert not random_tree.is_perfect# Create a binary search tree manuallybst_tree = Node(50)bst_tree.left = Node(30)bst_tree.right = Node(70)bst_tree.left.left = Node(20)bst_tree.left.right =…