Why is a stack convenient for recursive computations?

A stack is convenient for recursive computations because recursion essentially organizes function calls into a stack by itself.

Every time a function calls itself:

1. Information about the current call is added to the stack: arguments, local variables, the return location.
2. After the current call finishes, this information is removed from the stack, and the program returns to where the call was made.

This way the stack automatically preserves the "return point" and the state of each function. Without it, the program would not be able to know where to return to after each recursive step.