mediumDSA

How does heapq work in Python?

Q: How does heapq work in Python?

`heapq` maintains a **binary min-heap** stored inside an **ordinary list**. The heap invariant is: every parent is **≤** its children, so the smallest element is always at index 0. The tree is implicit — for index `i`, children are at `2i+1` and `2i+2`: 1 3 2 7 <circle class

851 views

Understand the problem

Binary heap on a list.

heapqdata-structures

Attempt it yourself

Sketch your approach before reading the solution — that's what interviews test.

Stuck? AI Nudge Available

Get a conceptual hint to guide your logic without spoiling the final implementation.

Study the solution

The solution is waiting

Give it an honest attempt first — then compare your thinking with the full walkthrough.

Run the code

PYPriority queue and top-k with heapq

Practice

Join the discussion

Discussion (0)

No responses yet. Be the first to share what you think.

What is the LEGB rule for scope resolution?

How does a + b dispatch in Python?