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 data type is enum?
What do you mean by free pool?
What are the topics in data structures?
What is the Insertion Sort Code?.
Why is sorting important?
What is heap tree explain with example?
What does the term sorting refer to?
What is nsmutablearray?
Can hashtable have duplicate values?
Which algorithm is used in arrays sort?
Define degree of the node?
Describe the level term in a tree.