edited by
557 views

2 Answers

1 votes
1 votes

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

0 votes
0 votes
ans is correct 3 2 5 1 4 6 7

simply follow procedure of avl.
edited by

Related questions

0 votes
0 votes
1 answer
2
Nitesh Choudhary asked Apr 22, 2017
3,419 views
i want to read Tanenbaum Datastructure book. Can anyone tell me the source of pdf Tanenbaum Datastructure book ?