In this section, we will uncover the inner workings of recursive function calls, revealing the underlying system choreography. We'll explore how recursive calls are tracked using the call stack and how to represent recursive calls visually using recursion trees

Let's start with understanding how we can visualize the execution of a recursive function using a call tree.

Recursion tree representation

A recursion tree is a useful way to visualize the flow of a recursive function. Let's consider a pseudocode for the printNumbers() function that recursively prints numbers from 0 to `n