Explore modules

Heap & Priority Queue

Heap & Priority Queue.

Free theory article

Heap & Priority Queue.

Concept & interpretation

A heap is a specialized tree-based data structure that satisfies the heap property. It is commonly implemented as a binary heap, in which the tree is a nearly complete binary tree. Heaps are crucially used to implement priority queues, abstract data types where each element has an associated priority, and elements are dequeued according to their priority rather than the order they were enqueued (unlike standard queues).

Read the full free theory article