All technological notes.
priority queue
Each element in a priority queue has an associated priority. In a priority queue, elements with high priority are served before elements with low priority.
Use Case:
To improve performance, priority queues are typically based on a heap, giving O(log n) performance for inserts and removals, and O(n) to build the heap initially from a set of n elements.