consider a complete AVL tree of two levels containing keys 10,20 and 30.

insert keys 40,50,45,28,25,26 and then delete keys 50,10,20. show step by step the appropriate rotations and the balancing factors of nodes.