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
B. AVL trees allow faster search operations
C. AVL trees require less space
D. AVL trees are easier to implement
Answer: Option A
This Question Belongs to Data Structure >> Trees In Data Structures
Join The Discussion