Course contentsShow
← Java
Lesson 228 of 2,8705. Methods and Function CallsFree lesson

Tracing Recursive Execution: The Call Stack

Each recursive call pushes a new stack frame; when the base case is reached, calls unwind and return.

Tracing Recursive Execution: The Call Stack

What you'll learn: You'll see exactly how Java manages recursive method calls using the call stack—pushing frames on the way down and popping them on the way back up.

How Java Tracks Recursive Calls

When a method calls itself recursively, Java doesn't just "remember" where it was—it creates a brand new stack frame for each call. Think of the call stack like a stack of cafeteria trays: each recursive call adds a tray on top, and when a call finishes, Java removes the top tray and returns to the one beneath it.

The Journey Down and Back Up

Let's trace factorial(3) step by step:

public static int factorial(int n) {
    if (n == 0) {
        return 1;  // base case
    }
    return n * factorial(n - 1);  // recursive case
}

Going down (pushing frames):

  1. factorial(3) is called → waits for factorial(2)
  2. factorial(2) is called → waits for factorial(1)
  3. factorial(1) is called → waits for factorial(0)
  4. factorial(0) is called → base case reached! Returns 1

Coming back up (popping frames): 5. factorial(1) receives 1, computes 1 * 1 = 1, returns 1 6. factorial(2) receives 1, computes 2 * 1 = 2, returns 2 7. factorial(3) receives 2, computes 3 * 2 = 6, returns 6

Each frame stores its own copy of n and its own return address. The stack grows deeper with each recursive call until the base case is reached, then unwinds as each frame returns its result.

Key Takeaway: Each recursive call pushes a new stack frame containing local variables and return information; when the base case is reached, frames pop off one by one, returning values back up the chain until the original call completes.