Suppose we have built a (balanced) AVL tree by inserting the keys 12, 7, 9, 17, 14 in this order. Suppose we insert anot

[answerhappygod]

Suppose We Have Built A Balanced Avl Tree By Inserting The Keys 12 7 9 17 14 In This Order Suppose We Insert Anot 1 (40.89 KiB) Viewed 12 times

Suppose we have built a (balanced) AVL tree by inserting the keys 12, 7, 9, 17, 14 in this order. Suppose we insert another key 16 into the tree, answer the following questions. Note: for all answers, please use no spaces, and for Answer 3, please use R or L or LR or RL. The imbalanced node to be repaired in the tree contains key The balance factor of this key is The required rotation is the rotation.