Select the correct answerWhat data structure from the following is used for implementing recursion?OptionsStackListQueueArray

The correct answer is Stack.

Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem. The use of stack data structure is prominent in the implementation of recursion.

When a recursive call is made by a function, all necessary information including the return address, the passed parameters, local variables and registers are stored in a stack. When the recursive call is completed, it uses this information stored in the stack to return to the caller function. Hence, Stack is the correct answer.

The correct answer is Stack.

Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem. The use of stack data structure is prominent in the implementation of recursion.

When a function is called in a program, the details such as where to return after the function call, what are the variables, etc., are stored in the stack. When a recursive function is called, the same process repeats, and each recursive call has its stack frame on the stack. Hence, the stack is used for implementing recursion.