Which of the following data structures can be efficiently implemented using height balanced binary search tree?
Posted: Wed Jul 13, 2022 7:42 pm
a) sets
b) priority queue
c) heap
d) both sets and priority queue
b) priority queue
c) heap
d) both sets and priority queue