Heap ·
Priority Queue
un
seel
.com · min-heap · priority queue · complete binary tree
Extract min
O(log n)
Insert
O(log n)
phase
—
Root / min
Left child
Right child
Swap path
Extracted
▶ Play
←
→
🔇 Unmute
Reset
Un
seel
.com · Heap