avl tree and heap problem.. of data structure subject..

there is no solution, so i need it..

please help me

Pro oble m. Assume avl is a class variable that represents an AVLtree. Starting from the tre shown below, draw the tree structure after executing each of the following operations. 24 avl .insert (38) avl. remove (19) i 37 13 avl. insert (35) avl. remove (42); 30 42 1) After executing avl.insert (38) 2) After executing avl. remove (19) 3) After executing avl.insert (35) 4) After executing avl. remove (42)