Data structure to implement a priority queue - Heap

Q.  What is the most appropriate data structure to implement a priority queue?
- Published on 23 Jun 15

a. Heap
b. Circular array
c. Linked list
d. Binary tree

ANSWER: Heap

Related Content

 

    Discussion

  • Nihal   -Posted on 01 Apr 16
    Heap is the most appropriate data structure to implement a priority queue.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲