Interested to Buy Any Domain ? << Click Here >> for more details...
What is the data structures used to perform recursion?
- 1 Answers
- 2149 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 |
Which is the parent class of deque<e> class?
Which is the parent class of linkedlist class?
Define secondary clustering?
What is definition list?
What is difference between an Array and ArrayList?
Define linked lists?
What is entryset in hashmap?
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
What are the types of bulleted list?
What are dynamic data structures?
Explain Linked List
Explain about Merge Sort?
Windows 
