| 1 | 8 | ||||||||||||||||||||
| 9 | |||||||||||||||||||||
| 6 | 2 | ||||||||||||||||||||
| 3/5 | |||||||||||||||||||||
| 7 | |||||||||||||||||||||
| 4 | |||||||||||||||||||||
1. An error that occurs when the call stack exceeds its limit due to too many recursive calls.
2. A form of recursion that explores all potential candidates for a solution.
3. A programming technique where a function calls itself to solve a problem.
4. A data structure that keeps track of function calls in a program.
5. The part of a function that includes a call to itself.
6. A section of the stack that contains all the information needed to execute a function.
7. A condition that stops the recursion from continuing.
8. The location in memory where control is transferred after a function call completes.
9. The process of removing elements from a stack to return to a previous state.