Which of the following statements about AVL trees is true?
A. They are a type of self-balancing binary search tree.
B. They allow duplicate keys.
C. They do not require balancing.
D. They only support insertion operations.
Answer: Option A
This Question Belongs to Data Structure >> Trees In Data Structures
Join The Discussion