Q160
Which of the following data structures can be efficiently implemented using height balanced binary search tree?
A.
sets
B.
priority queue
C.
heap
D.
both sets and priority queue
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board