Question:

Which data structure is used in the implementation of recursion?

Show Hint

When using recursion, the call stack keeps track of the function calls and their return values.
Updated On: Jun 17, 2025
  • Stack
  • Queue
  • Linked List
  • Array
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

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.
Was this answer helpful?
0
0