Three insertions into an empty AVL tree

Starting from an empty AVL tree, keys are inserted in this order: 30, 10, 20. After inserting 20, the tree becomes unbalanced at the root. Which rebalancing operation does the AVL insertion algorithm perform, and what is the new root?

1 of 46 in Data Structures & Algorithms