Which of the following data structures finds its use in recursion?

The data structure that finds its use in recursion is the Stack.

Here's why:

1. Recursion involves the process of a function calling itself while solving a problem. This means that for each recursive call, the system needs to remember the return address so that after completing the execution of the current call, it can return to the point where it left off in the previous call.

2. This is where the Stack data structure comes into play. A Stack follows the Last-In-First-Out (LIFO) principle. This means that the last function call that is placed onto the Stack is the first one to be taken off when the function has completed its execution.

3. Therefore, during recursion, each time a recursive call is made, the return address of the function is stored in the Stack. And when the function has completed its execution, the return address is popped from the Stack to return to the point in the function where it left off.

4. This makes the Stack an essential data structure for managing the execution of recursive function calls.