# Min-Heap

*noun*

say it: **“MIN HEEP”** **/mɪn hiːp/**

A heap where every parent is smaller than or equal to its children, so the smallest value is always on top.

## What is a **min-heap**?

A **min-heap** keeps every parent smaller than or equal to its children, so the smallest value sits at the top. It's what a priority queue uses when the smallest number means the most urgent, such as triage level 1.

## In a sentence

- “Urgency 1 is the most urgent, so the waiting list is a **min-heap**.”

Level: Journeyman · [More Data Structures terms at this level](https://www.ask-codey.com/glossary?category=data-structures&level=3)

Updated: November 9, 2026

Source: https://www.ask-codey.com/glossary/min-heap
