Askmeabout

Lets share our knowledge

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

Q & A › Category: Data Structure › Which of the following data structures can be efficiently implemented using height balanced binary search tree?
0 Vote Up Vote Down
Admin Staff asked 4 years 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

1 Answers
0 Vote Up Vote Down
Admin Staff answered 4 years ago

d) both sets and priority queue