Data Structures AVL Tree

Question

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

Answer 1

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.

Answer 2

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.

Answer 3

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.