1 votes 1 votes Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 b) 5 4 3 2 1 c) 3 2 4 1 5 d) 4 3 1 2 5 Programming in C avl-tree data-structures + – slowpoke asked May 8, 2017 • retagged Jun 18, 2019 by Cristine slowpoke 792 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes in option a,b,d when we insert first 3 element it require rotation but in option c no need of any rotation simply just insert. option c is correct. anonymous answered May 8, 2017 anonymous comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The answer will be (C) while constructing the tree using the given elements, at every step, balance factor of each node takes values 0,+1 or -1, hence no rotation(s) required. Aishik answered May 8, 2017 Aishik comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes c) 3 2 4 1 5 If we insert the above sequence in AVL tree, no adjustment is needed.because none of the node get unbalance during insertion. Raushank2 answered May 8, 2017 Raushank2 comment Share Follow See all 0 reply Please log in or register to add a comment.