Show the contents of an initially empty avl tree

Question

Show the contents of an initially empty AVL tree at the end of each of the following
sequences of operations:
i. Insert(35); Insert(55); Insert(80);
ii. Insert(60); Insert(70); Insert(65);
iii. Insert(15); Insert(50); Remove(60);
iv. Remove(65); Remove(80); Remove(70);
(b) Find an example AVL tree such that removing a single (specic) value from the tree
causes rebalancing to occur starting at two dierent nodes.