Priority Queue Introduction and Concept in DSA Python - Time & Space Complexity

Time Complexity: Priority Queue Introduction and Concept

O(log n)

Understanding Time Complexity

We want to understand how the time to add or remove items in a priority queue changes as we add more items.

How does the work grow when the queue gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

import heapq

pq = []
heapq.heappush(pq, 5)  # Add item with priority 5
heapq.heappush(pq, 1)  # Add item with priority 1
heapq.heappush(pq, 3)  # Add item with priority 3
smallest = heapq.heappop(pq)  # Remove smallest item
print(smallest)

This code adds items to a priority queue and removes the smallest item.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Adding or removing an item in the heap (priority queue).
• How many times: Each add or remove operation works by moving items up or down the heap tree, which takes steps proportional to the height of the tree.

How Execution Grows With Input

As the number of items (n) grows, the height of the heap grows slowly, about the logarithm of n.

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

Pattern observation: The steps grow slowly as the queue gets bigger, not directly with n but with log n.

Final Time Complexity

Time Complexity: O(log n)

This means adding or removing an item takes a small number of steps that grow slowly as the queue size grows.

Common Mistake

[X] Wrong: "Adding or removing items in a priority queue takes the same time no matter how many items are inside."

[OK] Correct: Actually, the time depends on the height of the heap, which grows with the number of items, so bigger queues take more steps.

Interview Connect

Understanding how priority queues work and their time costs helps you explain efficient ways to manage tasks by priority in real projects.

Self-Check

"What if we used a simple list and sorted it every time we add an item? How would the time complexity change?"

Practice

1. What is the main feature of a priority queue compared to a regular queue?

easy

A. It does not allow insertion after creation

B. Elements are always dequeued in the order they were inserted

C. It only stores elements of the same value

D. Elements are dequeued based on their priority, not just order of insertion

Solution

1. Step 1: Understand queue behavior

   A regular queue removes elements in the order they were added (FIFO).

2. Step 2: Understand priority queue behavior

   A priority queue removes elements based on priority, not just order.

3. Final Answer:

   Elements are dequeued based on their priority, not just order of insertion -> Option D

4. Quick Check:

   Priority queue = priority-based removal [OK]

Hint: Priority queue removes highest priority first, not oldest [OK]

Common Mistakes:

• Confusing priority queue with FIFO queue
• Thinking priority queue only stores equal values
• Assuming no insertion allowed after creation

2. Which of the following is the correct way to import and create a min-priority queue using Python's heapq module?

easy

A. from queue import PriorityQueue; pq = PriorityQueue()

B. import heapq; pq = []

C. import heapq; pq = heapq.PriorityQueue()

D. import queue; pq = queue.heapq()

Solution

1. Step 1: Identify correct module for heapq min-priority queue

   Python's heapq module implements min-heap using lists.

2. Step 2: Check import and creation syntax

   import heapq; pq = [] correctly imports heapq and creates an empty list to use as heap.

3. Final Answer:

   import heapq; pq = [] -> Option B

4. Quick Check:

   heapq module with empty list = correct [OK]

Hint: heapq uses empty list [] for min-heap [OK]

Common Mistakes:

• Confusing heapq (functions) with PriorityQueue class
• Trying to call heapq.PriorityQueue() which doesn't exist
• Wrong import statements

3. What will be the output of the following code?

import heapq
pq = []
heapq.heappush(pq, 20)
heapq.heappush(pq, 5)
heapq.heappush(pq, 15)
print(heapq.heappop(pq))

medium

A. 5

B. 20

C. 15

D. Error

Solution

1. Step 1: Understand heapq behavior

   heapq creates a min-heap, so smallest element is popped first.

2. Step 2: Trace the pushes and pop

   Elements pushed: 20, 5, 15. The smallest is 5, so heappop returns 5.

3. Final Answer:

   5 -> Option A

4. Quick Check:

   Min-heap pop = smallest element = 5 [OK]

Hint: heapq pops smallest element first [OK]

Common Mistakes:

• Thinking heapq pops largest element
• Confusing push order with pop order
• Expecting error due to empty heap

4. Identify the error in the following code that tries to implement a max-priority queue using heapq:

import heapq
pq = []
heapq.heappush(pq, 10)
heapq.heappush(pq, 30)
heapq.heappush(pq, 20)
max_val = heapq.heappop(pq)
print(max_val)

medium

A. pq should be a list of tuples, not integers

B. heapq does not support push operation

C. heapq.heappop returns the smallest element, not the largest

D. Missing call to heapq.heapify before pushing

Solution

1. Step 1: Understand heapq default behavior

   heapq implements a min-heap, so heappop returns smallest element.

2. Step 2: Check code for max-priority queue logic

   The code pushes values directly and pops, expecting max but gets min.

3. Final Answer:

   heapq.heappop returns the smallest element, not the largest -> Option C

4. Quick Check:

   heapq pop = smallest, not max [OK]

Hint: heapq pops smallest; invert values for max-heap [OK]

Common Mistakes:

• Expecting heappop to return max without inversion
• Not using negative values to simulate max-heap
• Assuming heapq needs heapify before every push

5. You want to implement a max-priority queue using Python's heapq module. Which approach correctly achieves this?

hard

A. Push negative values and pop normally, then negate again

B. Use heapq as is, it supports max-heap by default

C. Sort the list after every push to get max element

D. Use a separate max() function after popping from heapq

Solution

1. Step 1: Understand heapq default behavior

   heapq is a min-heap, so it pops smallest element by default.

2. Step 2: Implement max-heap using negation

   By pushing negative values, the smallest negative corresponds to largest original value. Pop and negate again to get max.

3. Final Answer:

   Push negative values and pop normally, then negate again -> Option A

4. Quick Check:

   Negate values to simulate max-heap with heapq [OK]

Hint: Invert values (negate) to use min-heap as max-heap [OK]

Common Mistakes:

• Assuming heapq supports max-heap natively
• Sorting list after every push is inefficient
• Using max() after pop breaks priority queue logic