1,422 views
1 votes
1 votes

Which of the following is false?
A. Maximum height of an AVL tree of n nodes is 1.44 log2n

​B.  Insertion of an element into an AVL tree requires at most a double rotation

C. Deletion of an element may require O(log n) rotation

D. None of these

1 Answer

Best answer
3 votes
3 votes
Answer is d

All the statement are correct

Option a :

The height of an AVL is bound by 1.44log n

option b )

If it is LL and RR then it would have 1 rotation only

But if LR and RL then it would have 2 rotation .

So atmost 2 rotation would required if AVL tree are not balanced .

Option c

AVL is favourable over  skewed tress have complexity of O(N) for deletion

But AVL are balanced tree so it would require logn for deletion

:) You can see this also

http://www.geeksforgeeks.org/avl-tree-set-1-insertion/
selected by

Related questions

1 votes
1 votes
1 answer
1
kd..... asked Apr 13, 2019
758 views
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZA-IMRAN-NAVEEN or RL rotation from IMRAN-NAVEEN-LOVELY
1 votes
1 votes
1 answer
2
Rahul_Rathod_ asked Dec 28, 2018
1,042 views
what is the maximum possible hight of AVL tree with 54 node?is there any general method to solve this question?
1 votes
1 votes
1 answer
3
Lakshman Bhaiya asked Nov 6, 2018
672 views
The minimum number of node in an AVL Tree of height $10$ is ____________
7 votes
7 votes
9 answers
4
syncronizing asked Sep 15, 2018
8,755 views
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...