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
Top TS PGECET Computer Science & Information Technology Questions