Vidyalelo
Data Structure · Q13

Trees in Data Structures

Programming · Data Structure · question 13

Q13

What is the main advantage of an AVL tree over a standard binary search tree?

A.
AVL trees maintain balance, ensuring O(log n) operations
Answer
B.
AVL trees allow faster search operations
C.
AVL trees require less space
D.
AVL trees are easier to implement

Answer: Option A

Solution

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