+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.