Priority queue with heaps in Data Structures Theory - Time & Space Complexity

Time Complexity: Priority queue with heaps

O(log n)

Understanding Time Complexity

We want to understand how the time needed to manage a priority queue using a heap changes as the number of items grows.

Specifically, how fast can we add or remove items when the queue gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following heap operations.

// Insert an element into a max-heap
function insert(heap, value) {
  heap.push(value)               // Add at the end
  let i = heap.length - 1
  while (i > 0 && heap[parent(i)] < heap[i]) {
    swap(heap, i, parent(i))     // Move up if bigger than parent
    i = parent(i)
  }
}

// Remove the max element from a max-heap
function extractMax(heap) {
  if (heap.length === 0) return null
  let max = heap[0]
  heap[0] = heap.pop()           // Replace root with last element
  if (heap.length > 0) {
    heapify(heap, 0)             // Fix heap property downwards
  }
  return max
}

This code shows how we add a new item and remove the largest item in a heap-based priority queue.

Identify Repeating Operations

Look at the loops that move elements up or down the heap.

• Primary operation: Swapping elements while moving up (insert) or down (extractMax) the heap.
• How many times: At most, the number of swaps equals the height of the heap, which grows as the heap grows.

How Execution Grows With Input

As the number of items n increases, the heap becomes taller, but not by much.

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

Pattern observation: The number of swaps grows slowly, roughly with the height of the heap, which increases logarithmically as the input size grows.

Final Time Complexity

Time Complexity: O(log n)

This means adding or removing an item takes time that grows slowly, roughly proportional to the number of times you can halve the number of items.

Common Mistake

[X] Wrong: "Adding or removing items in a heap is as slow as scanning all items, so it takes O(n) time."

[OK] Correct: The heap structure keeps items partially sorted in a tree shape, so operations only need to move along the height of the tree, not all items.

Interview Connect

Understanding heap operations and their time complexity shows you can work with efficient data structures that handle priority tasks quickly, a useful skill in many coding challenges.

Self-Check

"What if we used a simple unsorted list instead of a heap? How would the time complexity for adding and removing the highest priority item change?"

Practice

1. What is the main purpose of a priority queue implemented with a heap?

easy

A. To store elements in alphabetical order

B. To quickly access the highest priority element

C. To perform fast string searches

D. To sort elements in ascending order only

Solution

1. Step 1: Understand priority queue functionality

   A priority queue is designed to always provide quick access to the element with the highest priority.

2. Step 2: Recognize heap role in priority queue

   Heaps maintain the highest priority element at the top, enabling fast retrieval.

3. Final Answer:

   To quickly access the highest priority element -> Option B

4. Quick Check:

   Priority queue = fast highest priority access [OK]

Hint: Priority queue = fast access to top priority [OK]

Common Mistakes:

• Confusing priority queue with sorting
• Thinking it stores elements alphabetically
• Assuming it only sorts ascending

2. Which of the following is the correct way to insert an element into a max-heap based priority queue?

easy

A. Add element at the root and heapify up

B. Add element at the root and heapify down

C. Add element at the end and heapify down

D. Add element at the end and heapify up

Solution

1. Step 1: Understand insertion in max-heap

   New elements are added at the end (bottom level) to maintain complete tree property.

2. Step 2: Restore heap property by heapifying up

   Heapify up moves the new element up if it has higher priority than its parent.

3. Final Answer:

   Add element at the end and heapify up -> Option D

4. Quick Check:

   Insert = end + heapify up [OK]

Hint: Insert at end, then heapify up to fix heap [OK]

Common Mistakes:

• Adding element at root instead of end
• Heapifying down after insertion
• Confusing heapify directions

3. Given a max-heap priority queue with elements [40, 30, 20, 15, 10], what will be the heap array after extracting the max element?

medium

A. [30, 15, 20, 10]

B. [15, 30, 20, 10]

C. [20, 15, 10, 30]

D. [30, 10, 20, 15]

Solution

1. Step 1: Remove max element and replace with last

   Remove 40 (root), replace with last element 10: [10, 30, 20, 15]

2. Step 2: Heapify down to restore max-heap

   Compare 10 with children 30 and 20; swap with 30 (largest child): [30, 10, 20, 15]. Then compare 10 with 15; swap with 15: [30, 15, 20, 10].

3. Final Answer:

   [30, 15, 20, 10] -> Option A

4. Quick Check:

   Extract max + heapify down = [30, 15, 20, 10] [OK]

Hint: Replace root with last, then heapify down [OK]

Common Mistakes:

• Not swapping correctly during heapify down
• Forgetting to replace root with last element
• Confusing heapify up with heapify down

4. Identify the error in this pseudo-code for extracting the max from a max-heap priority queue:

extract_max(heap):
  max = heap[0]
  heap[0] = heap.pop()
  heapify_up(heap, 0)
  return max

medium

A. Should not assign max before popping

B. Should pop from the front instead of the end

C. Should call heapify_down instead of heapify_up

D. Should insert new element at the end before heapify

Solution

1. Step 1: Understand extract max steps

   Extract max removes root, replaces it with last element, then restores heap by heapifying down.

2. Step 2: Identify incorrect heapify call

   The code calls heapify_up, but after replacing root, heapify_down is needed to push the new root down if smaller.

3. Final Answer:

   Should call heapify_down instead of heapify_up -> Option C

4. Quick Check:

   Extract max = heapify down [OK]

Hint: Extract max uses heapify down, not up [OK]

Common Mistakes:

• Confusing heapify directions
• Popping from wrong end
• Misordering operations

5. You have a list of tasks with priorities: [(Task1, 5), (Task2, 3), (Task3, 5), (Task4, 2)]. Using a max-heap priority queue, which task will be extracted first and why?

hard

A. Task1, because it appears first among highest priority tasks

B. Task3, because it has the highest priority number

C. Task2, because it has the second highest priority

D. Task4, because it has the lowest priority

Solution

1. Step 1: Identify highest priority tasks

   Tasks with priority 5 are Task1 and Task3, highest among all.

2. Step 2: Understand heap extraction order for equal priorities

   Max-heap extracts highest priority; if priorities tie, extraction order depends on insertion order or heap structure. Usually, the first inserted among equals is extracted first.

3. Final Answer:

   Task1, because it appears first among highest priority tasks -> Option A

4. Quick Check:

   Highest priority + insertion order = Task1 first [OK]

Hint: Highest priority, then earliest inserted extracted first [OK]

Common Mistakes:

• Assuming any highest priority task is extracted first
• Ignoring insertion order for ties
• Picking lower priority tasks first