Recursion — call stack

Recursive call — stack frame; depth — overflow.

Try this in Python

def fact(n: int) -> int:
    if n <= 1:
        return 1
    return n * fact(n - 1)


print(fact(5))

Key takeaways

• Depth — max frames.
• Iterative — explicit stack.
• Recursion limit.