using python

using python please

21. [10] AVL Tree Generate an AVL tree by inserting the following keys (in the given order) into an initially empty AVL tree: 10,40, 25, 35, 30, 45. Draw an AVI, tree after the insertion of each key, one by one. Q2. [10] AVL Tree Draw the AVL tree after the removal of the key 20 from the AVL tree below. In the given tree, (a) specify three nodes z, y, x where a balance is broken, its tallest child and its tallest grandchild, respectively; then. (b) draw an AVL after each rotation to yield the final AVL tree. 150) 400 178 120 62 55 120