What data structure from the following is used for implementing recursion?

The data structure used for implementing recursion is the Stack.

Here's why:

1. In recursion, a function calls itself until a base condition is met. Each time the function is called, the old variables are pushed onto the system stack.

2. The system stack is a type of stack data structure that stores information about the active subroutines of a computer program.

3. When a recursive call is made, the current function execution is paused, and the call to the new function is added to the system stack.

4. Once the base condition is met, the function starts returning values. These values are popped from the system stack and used in the paused function calls.

5. Therefore, the stack data structure is used for implementing recursion.