What is the data structures used to perform recursion? Ans. Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used. - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
Ashish Verma
20 Apr 2023 11:35 AM study24x7 study24x7

What is the data structures used to perform recursion? Ans. Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the func...

See more

Web Development
Like Comment Share
study24x7
Write a comment
Related Questions
500+   more Questions to answer

Get the App

Download the Study24x7 App, so you can connect and collaborate.

study24x7
study24x7
Most Related Articles