1/6					7
		2
															8
				3
				4
																	9
							5

Across

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

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

3. A condition that stops the recursion from continuing.

4. The location in memory where control is transferred after a function call completes.

5. A form of recursion that explores all potential candidates for a solution.

Down

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

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

🖶