Which of the following data structures can be efficiently implemented using height balanced binary search tree?

Category: QuestionsWhich of the following data structures can be efficiently implemented using height balanced binary search tree?
Editor">Editor Staff asked 4 weeks ago

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
 
The above asked question is from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I
 
The question was asked by my school principal while I was bunking the class.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Correct choice is (d) both sets and priority queue
 
For explanation: Height-Balanced binary search tree can provide an efficient implementation of sets, priority queues.