What is the data structures used to perform recursion?
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 a list in data structure?
Is array immutable?
What is a node in it?
Why is quicksort so fast?
What is a hashset?
What is long data type?
Define linked lists?
Define non-linear data structures?
Explain the priority queue?
What is homogeneous array?
Compare Queue and Topic ?
Is arraylist reference type?