| Backtracking |
A form of recursion that explores all potential candidates for a solution. |
| Base Case |
A condition that stops the recursion from continuing. |
| Call Stack |
A data structure that keeps track of function calls in a program. |
| Recursion |
A programming technique where a function calls itself to solve a problem. |
| Recursive Case |
The part of a function that includes a call to itself. |
| Return Address |
The location in memory where control is transferred after a function call completes. |
| Stack |
A data structure that follows the Last In First Out (LIFO) principle. |
| Stack Frame |
A section of the stack that contains all the information needed to execute a function. |
| Stack Overflow |
An error that occurs when the call stack exceeds its limit due to too many recursive calls. |
| Unwinding |
The process of removing elements from a stack to return to a previous state. |
