Interested to Buy Any Domain ? << Click Here >> for more details...
What is the data structures used to perform recursion?
- 1 Answers
- 2079 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 the best case complexity of bubble sort?
Why is selection sort used?
What do you mean by open addressing?
Name a few tree data structure application.
What is the difference between static and dynamic data?
What are the disadvantages of linked list?
How are elements stored in hashset?
If you do not initialize an array what will happen?
What happens if we put duplicate key in hashmap?
Why do we need linked lists?
How can you insert a node at the end of linked list?
What is difference between array and arraylist?
Windows 
