Binary Heap. Insert values and watch them bubble up; extract the root and watch sift-down restore the heap property.

Min-Heap · complete binary tree node moving comparing settled
Array representation
Ready

Min-heap loaded. Insert a small value to watch it bubble up, or extract the root to see sift-down restore the heap property.

Speed
Demos
size
0
height
0
swaps (last op)
0
root (min/max)