What is the data structures used to perform recursion?
- 1 Answers
- 1809 Views
- I also Faced
- E-Mail Answers
Answer / phool chand
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.
| Is This Answer Correct ? | 0 Yes | 0 No |
Different Types of pattern?
What is the advantage of the heap over a stack?
How do you search for a target key in a linked list?
What happens if we try to insert duplicate key in hashmap?
Which sorting is best in time complexity?
What is dynamic data structure?
Why linked lists are better than arrays?
What is difference between stack and queue?
How does a selection sort work?
What does the dummy header in the linked list contain?
Is hashmap sorted?
What is the basic of data structure?
Windows 
