Interested to Buy Any Domain ? << Click Here >> for more details...
What is the data structures used to perform recursion?
- 1 Answers
- 2143 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 is the difference between hashmap and arraylist?
What is a simple path?
What are the four characteristics of algorithms?
Sorting is not possible by using which of the following methods? (a) Insertion (b) Selection (c) Exchange (d) Deletion
what is R-B tree
Explain binary searching, Fibinocci search.
How to find the duplicate in an array?
What is unhashable type list?
What is the complexity of sorting algorithm?
How many types of linked lists are there?
Are duplicates allowed in list?
How does a binary search work?
Windows 
