AVL tree is constructed by inserting the keys 2, 6, 1, 5, 3, 4, 7 in the given order. (Assume the tree is initially empty).
Then the level order traversal of the above binary tree will be..
Answer given is: 3,2,5,1,4,6,7
The given answer is correct, the balanced tree will look like this
The level order traversal is then - $3,2,5,1,4,6,7$
REF : here