Heap insertion (bubble up) in Data Structures Theory - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to insert a new element at the end of the heap array.

Data Structures Theory

heap.append([1])

Drag options to blanks, or click blank then click option'

Aparent

Bindex

Cvalue

Droot

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'index' or 'parent' instead of the actual value to insert.

Trying to insert at the root directly.

The new element to insert is added at the end of the heap array using append with the value to insert.

2fill in blank

medium

Complete the code to find the parent index of the newly inserted element at index i.

Data Structures Theory

parent = ([1] - 1) // 2

Drag options to blanks, or click blank then click option'

Ai

Bvalue

Cheap

Droot

Attempts:

3 left

💡 Hint

Common Mistakes

Using the value instead of the index to calculate the parent.

Using addition instead of subtraction.

In a binary heap stored as an array, the parent index of a node at index i is calculated as (i - 1) // 2.

3fill in blank

hard

Fix the error in the condition to continue bubbling up while the current index is greater than 0.

Data Structures Theory

while [1] > 0:

Drag options to blanks, or click blank then click option'

Avalue

Bi

Cheap

Dparent

Attempts:

3 left

💡 Hint

Common Mistakes

Checking the value instead of the index in the loop condition.

Using 'parent' or 'heap' in the condition incorrectly.

The bubbling up process continues while the current index i is greater than 0, meaning the node is not the root.

4fill in blank

hard

Fill both blanks to swap the current element with its parent if the heap property is violated.

Data Structures Theory

if heap[[1]] > heap[[2]]:
    heap[[1]], heap[[2]] = heap[[2]], heap[[1]]

Drag options to blanks, or click blank then click option'

Ai

Bparent

Cvalue

Droot

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'value' or 'root' instead of indices to access heap elements.

Swapping without checking the heap property.

To maintain the max-heap property, if the current element at index i is greater than its parent at index parent, they are swapped.

5fill in blank

hard

Fill all three blanks to update the current index to the parent's index after swapping during bubble up.

Data Structures Theory

heap[[1]], heap[[2]] = heap[[2]], heap[[1]]
i = [3]

Drag options to blanks, or click blank then click option'

Ai

Bparent

Dvalue

Attempts:

3 left

💡 Hint

Common Mistakes

Not updating the current index after swapping.

Using 'value' instead of indices for swapping.

After swapping the current element at index i with its parent at index parent, update i to parent to continue bubbling up.