Skip to main content
SWStudyWalks Search

Computer Science / Unit 3   CS 0110 short lesson, about 20 seconds

The Binary Heap

Captions available

The idea

A binary heap is a binary tree organized by the heap property — every node's priority at least its children's — keeping the highest-priority element at the root.

In practice

An emergency queue keeps the most urgent patient on top, whatever order patients arrived.

Where people slip

Not a search tree; the root is the one promise.

Your place on the trail

Every lesson rests on earlier ones and opens later ones. Tap any to jump.

Something wrong in this lesson? Flag it  ·  Sources for Computer Science