Recursion Base Case
Recursive Case Call Stack
Stack Overflow Backtracking
Stack Unwinding

 

A condition that stops the recursion from continuing. A programming technique where a function calls itself to solve a problem.
A data structure that keeps track of function calls in a program. The part of a function that includes a call to itself.
A form of recursion that explores all potential candidates for a solution. An error that occurs when the call stack exceeds its limit due to too many recursive calls.
The process of removing elements from a stack to return to a previous state. A data structure that follows the Last In First Out (LIFO) principle.

 

Return Address Stack Frame

 

A section of the stack that contains all the information needed to execute a function. The location in memory where control is transferred after a function call completes.