Heap insertion (bubble up) in Data Structures Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the purpose of the bubble up process in heap insertion?

The bubble up process restores the heap property by moving the newly inserted element up the tree until it is in the correct position.

beginner

In a max-heap, when does the bubble up process stop during insertion?

It stops when the inserted element is less than or equal to its parent or it becomes the root of the heap.

intermediate

What is the time complexity of heap insertion using bubble up?

The time complexity is O(log n), where n is the number of elements in the heap, because the element moves up at most the height of the heap.

beginner

Describe the relationship between parent and child nodes in a binary heap during bubble up.

During bubble up, the child node is compared with its parent. If the heap property is violated (child > parent in max-heap), they swap places to maintain the heap structure.

beginner

Why is bubble up necessary after inserting a new element at the end of the heap?

Because inserting at the end may break the heap property, bubble up fixes this by moving the new element up until the heap property is restored.

What is the first step after inserting a new element in a heap?

A Swap the root with the last element

B Remove the root element

C Place the element at the end and start bubble up

D Sort the entire heap

In heap insertion, the new element is added at the end, then bubble up is used to restore the heap property.

In a min-heap, bubble up continues as long as the child is:

A Less than the parent

B Greater than the parent

C Equal to the parent

D At the root

In a min-heap, bubble up moves the child up while it is less than its parent to maintain the heap property.

What is the maximum number of swaps during bubble up in a heap of size n?

A log n

B n

C n squared

D 1

The height of a binary heap is log n, so bubble up can swap at most log n times.

If the newly inserted element is larger than its parent in a max-heap, what happens?

A The heap is rebuilt

B They swap places

C Insertion stops

D The element is removed

In a max-heap, if the child is larger than the parent, they swap to maintain the heap property.

Where is the new element initially placed in the heap before bubble up?

A At a random position

B At the root

C In the middle

D At the end (last position)

New elements are inserted at the end of the heap array before bubble up adjusts their position.

Explain the bubble up process during heap insertion and why it is important.

Think about how the heap property is maintained after adding a new element.

Describe the difference in bubble up behavior between a max-heap and a min-heap.

Focus on the comparison direction for swapping.