Min-heap and max-heap properties in Data Structures Theory - Time & Space Complexity

Time Complexity: Min-heap and max-heap properties

O(log n)

Understanding Time Complexity

We want to understand how the time to maintain heap properties changes as the heap grows.

Specifically, how operations like insertion or removal scale with the number of elements.

Scenario Under Consideration

Analyze the time complexity of restoring heap properties after insertion.

function heapifyUp(heap, index) {
  while (index > 0) {
    let parent = Math.floor((index - 1) / 2);
    if (heap[parent] <= heap[index]) break; // For min-heap
    swap(heap, parent, index);
    index = parent;
  }
}
    

This code moves a newly added element up the heap to keep the min-heap property intact.

Identify Repeating Operations

Look at the loop that moves the element up the tree.

• Primary operation: Comparing and swapping with the parent node.
• How many times: At most once per level of the heap, moving from leaf to root.

How Execution Grows With Input

Each time we add an element, it may move up through the heap levels.

Input Size (n)	Approx. Operations
10	About 4 comparisons/swaps
100	About 7 comparisons/swaps
1000	About 10 comparisons/swaps

Pattern observation: Operations grow slowly, roughly proportional to the height of the heap, which increases with the logarithm of n.

Final Time Complexity

Time Complexity: O(log n)

This means the time to fix the heap grows slowly as the heap gets bigger, only increasing with the height of the tree.

Common Mistake

[X] Wrong: "Fixing the heap after insertion takes time proportional to the number of elements (O(n))."

[OK] Correct: The heap is a balanced tree, so the element only moves up the height of the tree, which is much smaller than the total number of elements.

Interview Connect

Understanding heap operations and their time complexity helps you explain efficient priority queue implementations and is a common topic in coding interviews.

Self-Check

"What if the heap was a max-heap instead of a min-heap? How would the time complexity of restoring the heap property change?"

Practice

1. Which of the following best describes a min-heap property?

easy

A. The tree is not necessarily complete.

B. The parent node is always larger than or equal to its children.

C. The root node is always the largest value.

D. The parent node is always smaller than or equal to its children.

Solution

1. Step 1: Understand min-heap property

   A min-heap requires that every parent node is smaller than or equal to its children.

2. Step 2: Compare options with definition

   The parent node is always smaller than or equal to its children. matches this definition exactly, while others describe max-heap or incorrect properties.

3. Final Answer:

   The parent node is always smaller than or equal to its children. -> Option D

4. Quick Check:

   Min-heap = parent ≤ children [OK]

Hint: Min-heap means smallest value at the top [OK]

Common Mistakes:

• Confusing min-heap with max-heap property
• Thinking the tree can be incomplete
• Assuming root is largest in min-heap

2. Which of the following is the correct way to describe a max-heap?

easy

A. A binary tree where each parent is smaller than its children.

B. A complete binary tree where each parent is greater than or equal to its children.

C. A tree where the root is always the smallest value.

D. A binary tree that is not necessarily complete.

Solution

1. Step 1: Recall max-heap definition

   A max-heap is a complete binary tree where each parent node is greater than or equal to its children.

2. Step 2: Match options to definition

   A complete binary tree where each parent is greater than or equal to its children. correctly states this. Options A and C describe min-heap or incorrect properties, and D is false because heaps must be complete.

3. Final Answer:

   A complete binary tree where each parent is greater than or equal to its children. -> Option B

4. Quick Check:

   Max-heap = parent ≥ children [OK]

Hint: Max-heap means largest value at the root [OK]

Common Mistakes:

• Mixing min-heap and max-heap definitions
• Ignoring the completeness of the tree
• Thinking root is smallest in max-heap

3. Given the max-heap array representation [50, 30, 40, 10, 20], what is the root value after inserting 60 and reheapifying?

medium

A. 60

B. 30

C. 40

D. 50

Solution

1. Step 1: Insert 60 at the end of the heap

   Array becomes [50, 30, 40, 10, 20, 60].

2. Step 2: Reheapify by comparing 60 with its parent

   60 is greater than 40 (its parent), so swap. New array: [50, 30, 60, 10, 20, 40]. Then compare 60 with 50 (new parent), swap again. Final array: [60, 30, 50, 10, 20, 40].

3. Final Answer:

   60 -> Option A

4. Quick Check:

   New root after insert = 60 [OK]

Hint: New max inserted bubbles up to root [OK]

Common Mistakes:

• Not swapping inserted value up correctly
• Confusing min-heap and max-heap behavior
• Forgetting to reheapify after insertion

4. Identify the error in this min-heap array: [5, 3, 8, 10, 7].

medium

A. The root 5 is larger than child 3, violating min-heap property.

B. The tree is not complete.

C. The array is sorted incorrectly.

D. No error; this is a valid min-heap.

Solution

1. Step 1: Check min-heap property for root and children

   Root is 5, left child is 3. Since 5 > 3, this violates the min-heap rule that parent ≤ children.

2. Step 2: Verify completeness and sorting

   The tree is complete and array order is not required to be sorted, so no error there.

3. Final Answer:

   The root 5 is larger than child 3, violating min-heap property. -> Option A

4. Quick Check:

   Parent ≤ children violated at root [OK]

Hint: Parent must be ≤ children in min-heap [OK]

Common Mistakes:

• Assuming array must be sorted
• Ignoring parent-child value checks
• Confusing completeness with heap property

5. You have a min-heap represented as [4, 10, 15, 20, 30]. You want to replace the root with 25 and restore the min-heap property. What will be the new root after reheapifying?

hard

A. 15

B. 4

C. 10

D. 20

Solution

1. Step 1: Replace root with 25

   Array becomes [25, 10, 15, 20, 30].

2. Step 2: Reheapify by pushing 25 down

   Compare 25 with children 10 and 15. The smallest child is 10, so swap 25 and 10. New array: [10, 25, 15, 20, 30].

3. Step 3: Continue reheapify

   Now 25 is at index 1 with children 20 and 30. 25 ≤ 20 and 30 is false, so swap 25 with 20. New array: [10, 20, 15, 25, 30].

4. Step 4: Check if heap property holds

   25 is now a leaf node, so heap property restored.

5. Final Answer:

   10 -> Option C

6. Quick Check:

   New root after replace and reheapify = 10 [OK]

Hint: Replace root, push down smaller child until heap restored [OK]

Common Mistakes:

• Not pushing down the replaced root correctly
• Swapping with larger child instead of smaller
• Stopping reheapify too early