Q31
Which of the following statements about AVL trees is true?
A.
They are a type of self-balancing binary search tree.
AnswerB.
They allow duplicate keys.
C.
They do not require balancing.
D.
They only support insertion operations.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board