What is the data structures used to perform recursion?
- 1 Answers
- 1797 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 |
What do you know about different sorting algorithms?
What is a class user?
Which interfaces are implemented by hashmap?
What is collections singletonmap?
What is the logic to reverse the array?
What is stack and queue in data structure?
Why do we use collections?
What is a reverse linked list.
What do you mean by balanced trees?
What is dynamic array in excel?
What are the different types of linked list?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
Windows 
