Vidyalelo
Data Structure · Q24

Trees in Data Structures

Programming · Data Structure · question 24

Q24

What is the time complexity of inserting an element into an AVL tree in the worst case?

A.
O(1)
B.
O(log n)
Answer
C.
O(n)
D.
O(n log n)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board