What is the data structures used to perform recursion?
- 1 Answers
- 1311 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 |
What is dangling pointer and how to avoid it?
Is treeset thread safe?
What is the capacity of arraylist?
Which is faster hashmap or concurrenthashmap?
Describe the degree term in a tree.
Difference between abstract data type, data type and data structure?
List the data structures which are used in network data modal.
Difference between arraylist and linkedlist?
Why is treeset sorted?
Why do we use binary search?
What is binary tree and its types?
What is pivot in quicksort?
Windows 
