1					8
				2
	3
7
			4
5
6

Across

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

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

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

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

5. The process of removing elements from a stack to return to a previous state.

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

Down

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

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

🖶