What is the data structures used to perform recursion?
- 1 Answers
- 1338 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is difference between data type and data structure?
Explain how to find 3rd element from end in a linked list in one pass?
What does arraylist remove return?
Is hashmap get thread safe?
What is a vector class?
Define an equivalence relation?
What is linked hash set?
In what scenario, binary search can be used?
Which is better hashmap or treemap?
What is the difference between hashmap and arraylist?
What are common data structures?
Is it legal to initialize list like this?
Is hashmap an object?
How many types of data structure are there?
What type of algorithm is binary search?
