What is the difference between the call stack and the heap in Python?

Q: What is the difference between the call stack and the heap in Python?

**Target Audience:** Developers coming from C, C++, Java or Go who want to map "stack vs heap" onto Python, and Python developers debugging recursion or memory **Difficulty:** Medium **Python version:** Checked on CPython 3.11, 3.12 and 3.13 (and in this page on Pyodide 0.25.1, which is CPython 3.11.3); all gave identical output > **How to read this doc:** Each idea is explained in plain language first, then tagged with `📌 Interview term:` so you also learn the exact word an interviewer expects. Every output block in the **Verified** section was printed by actually running the examples, not typed from memory. ## 1. Why This Even Matters — A Story First Think of a restaurant kitchen. Orders come in on paper tickets, and the chef stacks them on a spike: the newest ticket on top is the dish being made right now; when it is done, the ticket comes off and the one below is resumed. That spike is the **call stack**. Each ticket (a **frame**) says which dish, which step you are on, and whi

The problem

Question presented to candidate: "In languages like C or Java people talk about values on the stack and objects on the heap. How does that map to Python? What lives on the call stack, what lives on the heap, and what consequences does that have for recursion, closures and memory?"

What a strong answer should cover:

The call stack is the stack of frames, one per active function call; a frame holds the local variable slots (references), a small evaluation stack, and the position in the bytecode, and is linked to its caller via f_back.
Every Python object, including ints and strings, lives on the heap; locals in a frame are only references to heap objects. There is no "value type on the stack" in Python.
When a call returns its frame is discarded, but objects it created survive if anything still references them (a return value, a closure cell, a global).
The stack is bounded: sys.getrecursionlimit() (1000 by default) raises RecursionError; deep recursion can be converted to a loop with an explicit list as the stack, which lives on the heap.
CPython details: since 3.11 frames are cheap internal structures and frame objects are created lazily; generators keep their frame alive between next() calls; tracebacks keep frames and all their locals alive.

Code / implementation expected: Optional — walking sys._getframe() up the stack, or showing a recursive function hit RecursionError while an explicit-stack version succeeds.

memory
stack
heap

Try it yourself

Sketch your approach before you read the solution. That is what the interview tests.

Stuck? Get a hint.

A short nudge toward the approach. It will not give the answer away.

Solution

Target Audience: Developers coming from C, C++, Java or Go who want to map "stack vs heap" onto Python, and Python developers debugging recursion or memory Difficulty: Medium Python version: Checked on CPython 3.11, 3.12 and 3.13 (and in this page on Pyodide 0.25.1, which is CPython 3.11.3); all gave identical output

How to read this doc: Each idea is explained in plain language first, then tagged with 📌 Interview term: so you also learn the exact word an interviewer expects. Every output block in the Verified section was printed by actually running the examples, not typed from memory.

1. Why This Even Matters — A Story First

Think of a restaurant kitchen. Orders come in on paper tickets, and the chef stacks them on a spike: the newest ticket on top is the dish being made right now; when it is done, the ticket comes off and the one below is resumed. That sp

The solution is hidden so you can try first

11 min read · 11 sections

Run the code

Edit the code and run it here. Each console line with an expected value becomes a test.

PythonFrames on the stack, objects on the heap, closures that outlive frames

Practice

PythonRecursionError, an explicit heap stack, generator frames and tracebacks

Practice

Discussion

Other approaches, follow-ups and how it went in real interviews.

Sign in to join the discussion.

No comments yet. Share how you would answer it.

The solution is hidden so you can try first

Keep your momentum going.