Interested to Buy Any Domain ? << Click Here >> for more details...
Which data structure is applied when dealing with a recursive function?
- 1 Answers
- 1112 Views
- I also Faced
- E-Mail Answers
Answer / Pallavi Awasthi
A call stack is a data structure that stores function calls and their associated information during the execution of a program. When a recursive function is called, its information is pushed onto the call stack, allowing for proper function invocation order and memory management.
| Is This Answer Correct ? | 0 Yes | 0 No |
Explain what are the major data structures used in the rdbms?
Give the example of validating the parenthesis of expression using stack.
What is difference between data type and data structure?
What is frozenset?
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
Is hashmap an array?
What are the types of Collision Resolution Techniques and the methods used in each of the type?
What is linear and non linear structure?
Explain the term binding time?
Can we increase the size of statically allocated array?
Is hashtable fail fast?
How do you do a mergesort?
Windows 
