← CS 302 Home

Max-Heap — Interactive

Insert values to sift up, extract the maximum to sift down, and build a heap from an array. Watch the dual tree + array representation update in sync.

Normal
0
Nodes
0
Height
Last Op Swaps
Min Height
Try it: Load "Small Heap" and extract the max. Watch how the last element moves to the root and sifts down to restore the heap property.
Node
Comparing
Swapping
Settled