Interested to Buy Any Domain ? << Click Here >> for more details...
What is the data structures used to perform recursion?
- 1 Answers
- 2167 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 heap tree in data structure?
Is boolean a data type?
What are the 3 types of measurement?
Run time memory allocation is known as ?
Which interfaces are implemented by abstractqueue?
How is bubble sort done?
How many types of priority queue are there?
Mention for which header list, you will found the last node contains the null pointer?
What are the major data structures used in the network data model?
What is sort order?
How to increase stack limit in w3wp.exe?
List the area of applications where stack data structure can be used?
What is a map programming?
Does arraylist extend list?
Why is sorting and classifying important?
