Q53
A self - balancing binary search tree can be used to implement . . . . . . . .
A.
Priority queue
AnswerB.
Hash table
C.
Heap sort
D.
Priority queue and Heap sort
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board