It is hard to see how much work a recursive function does just by reading it. Drawing every call as a node shows the total number of calls (time) and the deepest chain of calls (space). Use it to find the complexity of functions like naive Fibonacci, where the tree reveals exponential growth. It also shows repeated calls with the same input, which is the signal to add memoization or switch to a loop.