Collection - Priority Queue

Data System Architecture

About

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

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

Implementation

Priority Queue are implemented generally with a heap structure




Discover More
Data System Architecture
Collection - Queue (FIFO)

A queue is collection: that follows by default a first-in, first-out methodology where the first element is the first element to be retrieved / removed where the concept of first may be defined....
Process States
Process - Priority

Process are stored in a priority queue and have then a priority
Binary Max Heap
Tree - Heap Data Structure

A heap is a tree data structure constructed from the priority number that needs to satisfy a heap property prioritypriority queues Heaps are favourite data structures for many applications: heap...



Share this page:
Follow us:
Task Runner