A priority queue is an abstract data type similar to a regular queue or stack data structure, but where each element has a priority assigned to it. Elements with higher priorities are served before elements with lower priorities, and if two elements have the same priority, they are served according to their order in the queue.

Priority Queue

priority queue

An Abstract Data Type (ADT) defines a data structure purely by its behavior from the point of view of a user, focusing on what operations are performed and not on how these operations are implemented. This allows for flexibility and abstraction in programming, enabling the underlying implementation to be changed without affecting the user's interaction with the data structure.

abstract data type

regular queue

A stack is a linear data structure that follows the Last In, First Out (LIFO) principle, where the last element added is the first to be removed. It is commonly used in scenarios like function call management, undo mechanisms in applications, and syntax parsing in compilers.

stack data structure

Elements with higher priorities

elements with lower priorities

same priority

order in the queue

Resources and Queues

Understanding Queue Modules

다익스트라 알고리즘 개요 및 원리

Data Structures

Relevant Degrees

Log in to see lessons