Question

Q9. The number of rotations (counting both single and double rotation as one rotation) required to
insert/delete a key to/from an AVL Tree (containing n keys) in the worst case, are:
(a) O(log n) and O(n)
(b) 1 and O(log n)
(c) O(log n) and O(log n)
(d) O(log n) and 1
(e) 1 and 1​

Answer 1

Explanation:

Q9. The number of rotations (counting both single and double rotation as one rotation) required to

insert/delete a key to/from an AVL Tree (containing n keys) in the worst case, are:

(a) O(log n) and O(n)

(b) 1 and O(log n)

(c) O(log n) and O(log n)

(d) O(log n) and 1

(e) 1 and 1