1/7											8
										2
3
4
5
				6

Across

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 process of removing elements from a stack to return to a previous state.

4. A section of the stack that contains all the information needed to execute a function.

5. A data structure that keeps track of function calls in a program.

6. A programming technique where a function calls itself to solve a problem.

Down

7. The part of a function that includes a call to itself.

8. An error that occurs when the call stack exceeds its limit due to too many recursive calls.

🖶