Priority Queue and implementation in C

Priority Queue :

  • In Priority queue, every node contains one more field i.e. priority of the node.
  • It decides the priority of each node in a queue.
  • Every element is serviced in order of their priority.
  • Highest priority elements are serviced first than next higher.
  • Elements are deleted in order of their priority.
  • It is implemented using linked list or heap. Heaps are more efficient than linked list.

 Implementation of Priority Queue in C :

Leave a Reply

Your email address will not be published. Required fields are marked *