AVL tree

Question

Following keys are inserted into a binary search tree and AVL tree in given order,
keys : 45 30 8 36 60 51
The following nodes are added into corresponding BST and AVL tree then what is the difference in height of BST and AVL tree ?
Keys : 4 16 25 are added afterwards in the corresponding trees

Answer 1

1 is answer.

Comments

I think insertion of last node 25 leads to Left-Right case which requires Double rotation.

And Resultant AVL tree's root should be 45 only.

plz verify me!!

Answer 2

BST(h) - AVL(h)= 4-3=1

Follow below fig.