+1 vote
84 views

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..

edited | 84 views

+1 vote

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

by Loyal (5.4k points)
ans is correct 3 2 5 1 4 6 7

by (291 points)
edited by
0
upload AVL tree construction if possible..
0
the given answer is correct !