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