What is the data structures used to perform recursion?
- 1 Answers
- 1846 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 do you mean by separate chaining?
Explain the common uses of tree database.
Describe linear probing with an example.
Does treeset remove duplicates?
Can we store primitives in collections?
What is a data structure definition?
Explain implementation of deletion from a binary tree.
What is a bubble sort and how do you perform it?
What is complexity algorithm?
Explain about circular linked list?
Why is sorting and classifying important?
What is the bucket size, when the overlapping and collision occur at same time?
Windows 
