Data structures use to carry out recursion
What is the data structures employed to carry out recursion?
Expert
Stack. Due to its LIFO (Last in First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes employ of system stack for storing return addresses of function calls.
Every recursive function has its equal iterative (non-recursive) function. Even when these equal iterative processes are written, explicit stack is to be employed.
Explain Tree database briefly.
In a linked list how can I search for data?
Give a brief description of the term Merge Sort?
What is the way to implement of deletion from a binary tree?
Give a small description of the term Arrays?
Illustrates about a linear and non linear data structure?
How Armstrong rules are complete sound?
Define when we should use a linked list instead of an array.
Define the two-dimensional array.
Briefly describe the term threaded binary tree. Elucidate its common uses?
18,76,764
1938081 Asked
3,689
Active Tutors
1460906
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!