Q23
In which data structure is an AVL tree commonly used?
A.
For managing dynamic arrays
B.
For implementing priority queues
C.
For maintaining balanced binary search trees
AnswerD.
For implementing hash tables
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board