Question

Which data structure is used in the implementation of recursion?

• A. Stack
• B. Queue
• C. Linked List
• D. Array

Hint:

When using recursion, the call stack keeps track of the function calls and their return values.

Answer 1

The Correct Option is A

Recursion is implemented using the call stack in memory. When a function is called, its execution is pushed onto the stack, and when it returns, it is popped off the stack. Thus, the stack data structure is used.