Heap Extract Min or Max Bubble Down in DSA Javascript - Execution Trace

Concept Flow - Heap Extract Min or Max Bubble Down

Start with heap array

↓

Remove root element

↓

Replace root with last element

↓

Bubble down: Compare with children

↓

Swap with smaller (min-heap) or larger (max-heap) child if needed

↓

Repeat bubble down until heap property restored

↓

Return extracted root

This flow shows how the root element is removed and the last element is moved down the heap to restore order.

Execution Sample

DSA Javascript

function extractRoot(heap) {
  const root = heap[0];
  const end = heap.pop();
  if (heap.length > 0) {
    heap[0] = end;
    bubbleDown(heap, 0);
  }
  return root;
}

This code removes the root of the heap, replaces it with the last element, then bubbles it down to restore heap order.

Execution Table

Step	Operation	Heap Array	Pointer Changes	Visual State
1	Initial heap	[10, 15, 30, 40, 50, 100, 40]	root → index 0 (10)	10 / \ 15 30 / \ / \ 40 50 100 40
2	Remove root (10)	[10, 15, 30, 40, 50, 100, 40]	root extracted	Root 10 extracted
3	Replace root with last element (40)	[40, 15, 30, 40, 50, 100]	root → index 0 now 40 (was last)	40 / \ 15 30 / \ / 40 50 100
4	Bubble down from index 0 (40)	[40, 15, 30, 40, 50, 100]	Compare 40 with children 15 (index 1) and 30 (index 2)	Current:40, Left child:15, Right child:30
5	Swap with smaller child (15)	[15, 40, 30, 40, 50, 100]	Swap index 0 and 1	15 / \ 40 30 / \ / 40 50 100
6	Continue bubble down at index 1 (40)	[15, 40, 30, 40, 50, 100]	Compare 40 with children 40 (index 3) and 50 (index 4)	Current:40, Left child:40, Right child:50
7	No swap needed (40 ≤ 40 and 50)	[15, 40, 30, 40, 50, 100]	Bubble down ends	15 / \ 40 30 / \ / 40 50 100
8	Return extracted root	[15, 40, 30, 40, 50, 100]	Returned 10	15 / \ 40 30 / \ / 40 50 100

💡 Bubble down stops when current node is smaller than both children or no children exist

Variable Tracker

Variable	Start	After Step 3	After Step 5	After Step 7	Final
heap array	[10, 15, 30, 40, 50, 100, 40]	[40, 15, 30, 40, 50, 100]	[15, 40, 30, 40, 50, 100]	[15, 40, 30, 40, 50, 100]	[15, 40, 30, 40, 50, 100]
root extracted	N/A	10	10	10	10
current index	0	0	1	1	N/A
left child index	1	1	3	3	N/A
right child index	2	2	4	4	N/A

Key Moments - 3 Insights

Why do we replace the root with the last element before bubbling down?

Replacing the root with the last element keeps the heap complete (no gaps). Then bubbling down restores the heap order. See execution_table step 3 where last element 40 moves to root.

Why do we compare the current node with both children during bubble down?

To maintain heap property, the current node must be smaller (min-heap) than both children. We swap with the smaller child if needed. See execution_table steps 4 and 5 for comparisons and swap.

When does the bubble down process stop?

Bubble down stops when the current node is smaller than both children or has no children. See execution_table step 7 where no swap is needed and bubble down ends.

Visual Quiz - 3 Questions

Look at the execution_table at step 5, which elements are swapped?

A Elements at index 0 and 1 (40 and 15)

B Elements at index 1 and 3 (40 and 40)

C Elements at index 0 and 2 (40 and 30)

D No elements are swapped

💡 Hint

Check the 'Swap with smaller child' operation and the heap array before and after step 5

At which step does the bubble down process stop?

A Step 4

B Step 6

C Step 7

D Step 8

💡 Hint

Look for the step where 'No swap needed' and 'Bubble down ends' are mentioned

If the last element was larger than the root, what would happen at step 3?

A The root would be replaced but no bubble down needed

B The root would be replaced and bubble down would swap it down

C The root would not be replaced

D The heap would become incomplete

💡 Hint

Refer to the bubble down logic in execution_table steps 3 to 7

Concept Snapshot

Heap Extract Min or Max Bubble Down:
- Remove root element (min or max)
- Replace root with last element
- Bubble down: swap with smaller (min) or larger (max) child
- Repeat until heap property restored
- Return extracted root

Full Transcript

This visualization shows how to remove the root element from a heap and restore heap order by bubbling down the last element moved to the root. The process starts by removing the root and replacing it with the last element in the heap array. Then, the bubble down operation compares this element with its children and swaps it with the smaller child in a min-heap if needed. This repeats until the element is smaller than both children or has no children. The final heap maintains the heap property and the extracted root is returned.