Heap Insert Operation Bubble Up in DSA Javascript - Build from Scratch

Heap Insert Operation Bubble Up

📖 Scenario: You are managing a priority queue for tasks using a min-heap. When a new task with a priority number is added, it must be placed correctly to keep the heap property intact.

🎯 Goal: Build a min-heap insert operation that adds a new number to the heap array and uses bubble up to restore the heap order.

📋 What You'll Learn

Create an array called heap with the exact values [10, 15, 20, 17, 25]

Create a variable called newValue and set it to 8

Write a function called bubbleUp that takes the heap array and bubbles up the last element to maintain min-heap order

Call the bubbleUp function after adding newValue to heap

Print the heap array after insertion and bubble up

💡 Why This Matters

🌍 Real World

Priority queues are used in task scheduling, network routing, and event management where the smallest or highest priority item must be processed first.

💼 Career

Understanding heap insertions and bubble up operations is essential for software engineers working on performance-critical applications, algorithms, and data structure implementations.

1

Create the initial heap array

Create an array called heap with these exact values: [10, 15, 20, 17, 25]

DSA Javascript

// Create the heap array with the given values
// Your code here

Hint

Use const heap = [10, 15, 20, 17, 25]; to create the array.

2

Add the new value to insert

Create a variable called newValue and set it to 8

DSA Javascript

const heap = [10, 15, 20, 17, 25];
// Create the newValue variable and set it to 8
// Your code here

Hint

Use const newValue = 8; to create the variable.

3

Write the bubbleUp function and insert newValue

Write a function called bubbleUp that takes the heap array and bubbles up the last element to maintain min-heap order. Then add newValue to heap and call bubbleUp(heap)

DSA Javascript

const heap = [10, 15, 20, 17, 25];
const newValue = 8;

// Write bubbleUp function and insert newValue
// Your code here

Hint

Use a while loop to compare the last element with its parent and swap if smaller.

4

Print the heap after insertion and bubble up

Print the heap array after insertion and bubble up using console.log(heap)

DSA Javascript

const heap = [10, 15, 20, 17, 25];
const newValue = 8;

function bubbleUp(heap) {
    let index = heap.length - 1;
    while (index > 0) {
        let parentIndex = Math.floor((index - 1) / 2);
        if (heap[index] >= heap[parentIndex]) {
            break;
        }
        // Swap
        [heap[index], heap[parentIndex]] = [heap[parentIndex], heap[index]];
        index = parentIndex;
    }
}

heap.push(newValue);
bubbleUp(heap);

// Print the heap array
// Your code here

Hint

Use console.log(heap) to print the array.