Priority Queue

Seite 1

Priority Queue can be implemented using Arrays, linkedlist or heaps. http://www.geeksforgeeks.org/priority-queue-set-1-introduction/

A typical priority queue supports following operations.

insert(item, priority): Inserts an item with given priority.

getHighestPriority(): Returns the highest priority item.

deleteHighestPriority(): Removes the highest priority item.

Time Complexity for different implementation styles is different

Applications of Priority Queue:

1) CPU Scheduling

2) Graph algorithms like Dijkstra’s shortest path algorithm, Prim’s Minimum Spanning Tree, etc

3) All queue applications where priority is involved.