priority queue

Abstract data type in computer science

EntityQ629283

Subclass of: queue

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its order of service. Priority queue serves highest priority items first. Priority values have to be instances of an ordered data type, and higher priority can be given either to the lesser or to the greater values with respect to the given order relation. For example, in the Java standard library, the PriorityQueue class considers the lowest element with respect to their order as having the highest priority.

Overview

All data

11 statements · 18% with external sources · numbers in brackets are citations

Has use: prioritization
Uses: heap nature of statement: often

On other databases

9 identifiers linking priority queue across the web's reference databases

Data quality

statements

18%

externally sourced

Source last edited September 20, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q629283

API docs, limits & keys

Cite this page

AIDB. (2026). priority queue (Q629283). Retrieved from https://aidb.si/e/priority-queue-Q629283