Interested to Buy Any Domain ? << Click Here >> for more details...
What is the data structures used to perform recursion?
- 1 Answers
- 2161 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 |
Can arraylist contain duplicates?
What is an iterative algorithm?
What do you mean by heap order property?
Can map contain duplicate keys?
Explain the expression trees?
What are the different types of sorting in data structure?
What is an array vs list?
Calculate the address of a random element present in a 2d array, given base address as ba.
Explain the uses of b+ tree.
write a program to accept name & sort them?
What is array and structure?
What is data structure and its operations?
Windows 
