Which data structure is most efficient for implementing a priority queue? - Study24x7
Social learning Network
2 followers study24x7 29 Aug 2024 11:12 AM study24x7 study24x7

Which data structure is most efficient for implementing a priority queue?

A

Binary search tree

B

Hash table

C

Binary heap

D

Linked list

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles