Heap Insert Operation Bubble Up in DSA C++ - 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 value is added, it must be placed correctly to keep the heap property intact.

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

📋 What You'll Learn

Create a vector called heap with initial values {10, 15, 20, 17, 25}

Create an integer variable called newValue and set it to 8

Write code to insert newValue at the end of heap and bubble it up to maintain min-heap order

Print the final state of heap after insertion

💡 Why This Matters

🌍 Real World

Priority queues are used in task scheduling, network routing, and event simulation where the smallest or highest priority item must be accessed quickly.

💼 Career

Understanding heap insertions and bubble up is essential for software engineers working on performance-critical applications, databases, and real-time systems.

1

Create the initial heap vector

Create a std::vector<int> called heap with these exact values: {10, 15, 20, 17, 25}

DSA C++

# Your code here

Hint

Use std::vector<int> and initialize it with the given values.

2

Add the new value to insert

Create an integer variable called newValue and set it to 8

DSA C++

#include 
#include 

int main() {
    std::vector heap = {10, 15, 20, 17, 25};
    // Your code here
}

Hint

Declare int newValue = 8; inside main().

3

Insert and bubble up the new value

Insert newValue at the end of heap using push_back. Then use a while loop with variables index and parent to bubble up the new value until the min-heap property is restored.

DSA C++

#include 
#include 

int main() {
    std::vector heap = {10, 15, 20, 17, 25};
    int newValue = 8;
    // Your code here
}

Hint

Use push_back to add newValue. Then bubble up by swapping with parent while smaller.

4

Print the heap after insertion

Use a for loop with variable val to print all elements of heap separated by spaces on one line.

DSA C++

#include 
#include 

int main() {
    std::vector heap = {10, 15, 20, 17, 25};
    int newValue = 8;
    heap.push_back(newValue);
    int index = heap.size() - 1;
    while (index > 0) {
        int parent = (index - 1) / 2;
        if (heap[parent] <= heap[index]) {
            break;
        }
        std::swap(heap[parent], heap[index]);
        index = parent;
    }
    // Your code here
}

Hint

Print all elements in heap separated by spaces on one line.