1 votes 1 votes 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 Programming in C data-structures + – balchandar reddy san asked Jan 28, 2019 edited Jan 29, 2019 by balchandar reddy san balchandar reddy san 557 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Shobhit Joshi answered Jan 29, 2019 Shobhit Joshi comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes ans is correct 3 2 5 1 4 6 7 simply follow procedure of avl. _sonu answered Jan 28, 2019 edited Jan 29, 2019 by _sonu _sonu comment Share Follow See all 2 Comments See all 2 2 Comments reply balchandar reddy san commented Jan 29, 2019 reply Follow Share upload AVL tree construction if possible.. 0 votes 0 votes Shaik Masthan commented Jan 29, 2019 reply Follow Share the given answer is correct ! 0 votes 0 votes Please log in or register to add a comment.