Interested to Buy Any Domain ? << Click Here >> for more details...
What is the data structures used to perform recursion?
- 1 Answers
- 2082 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 the difference between for and foreach loop?
What do you mean by shortest path?
What is data structure operations?
Does linked list allow null values?
What is reduction to sorting method?
What is bubble sort and quick sort?
What is difference between arraylist and linkedlist?
What are the basic data structures?
What is dynamic array in excel?
What is the use of data structure?
Mention one advantage and disadvantage of using quadratic probing?
Why is hashset not ordered?
What is difference between while and do while?
What do you understand by doubly linked list?
Does hashset allow duplicates?
