Priority Queues - gitpayal/DataStructures GitHub Wiki

Prority queue 🥇

Priority queue are data structure who process data in specific order. It provides more flexibility than simple sorting because new elements can be inserted at arbitrary intervals.

It is more cost effective to insert a new job into a priority queue than resort everything on each interval.

Basic priority queue operations involve Insert(Q,x) Find-Minimum/Find-Maximum Delete-Minimum/Delete-MAximum