Interested to Buy Any Domain ? << Click Here >> for more details...
What is the data structures used to perform recursion?
- 1 Answers
- 2172 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 |
Differentiate between hashset and hashmap.
What is bubble insertion selection sort?
What's the difference between an array and vector?
What is the best sorting technique?
ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm
Explain the most efficient method to reverse a linked list?
What is type structure?
Explain quick sort and merge sort algorithms.
Write a code for dynamic allocation of array.
What is the type of the algorithm used in solving the 8 Queens problem?
What is a circular singly linked list?
List the applications of queues?
Windows 
