Stacks commonly organize call-local execution state; heap allocation supports separately managed lifetimes. Exact language and runtime behavior can differ.
Before you start
You should understand processes, threads, memory and basic file operations. Track ownership and state changes over time. For concurrent scenarios, write down at least two possible execution orders; the same instructions can behave differently when scheduling or resource availability changes.
The practical goal is to reason through this situation: Deep recursion consumes call-stack space even when data values are small. Read the walkthrough first, then try the interview exercise before opening its answer. The important part is explaining the decision and its consequences, rather than remembering a definition alone.
Step-by-step walkthrough
Step 1: Trace call lifetime
Recursive calls can retain frames until their descendants return.
Step 2: Identify retained allocations
Heap objects can outlive a call under runtime-managed ownership.
Step 3: Bound recursion
A deep chain may exhaust call-stack capacity even with tiny payloads.
Worked scenario
Deep recursion consumes call-stack space even when data values are small.
A recursive walk of a million-node linked list creates one active frame per node before unwinding. Replacing it with an iterative loop removes that call-depth requirement. Exact placement of individual variables remains language and runtime dependent; stack versus heap is a useful lifetime model, not a universal source-code allocation rule.
Common mistake
Treating every local variable as permanently stack-allocated ignores runtime implementation and escaping values.
Verify the behavior
Trace maximum depth and compare with the iterative equivalent.
Interview exercise
Explain a stack overflow.
Answer and reasoning
Trace recursion depth and frame use, then use a suitable iterative approach or bounded recursion.
Continue learning
Compare the scenario with the Operating Systems interview questions and test your understanding with the Operating Systems MCQs. For terminology and implementation details, consult the reference material.