Collection - Priority Queue

1 - About

A priority queue is a queue where the first element to be retrieved is an element that has the highest priority attribute.

3 - Characteristic

  • An element with high priority is served before an element with low priority.
  • If two elements have the same priority, they are served according to the order in which they were enqueued

4 - Implementation

Priority Queue are implemented generally with a heap structure

Data Science
Data Analysis
Data Science
Linear Algebra Mathematics

Powered by ComboStrap