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 the queue operation in brief.
Explain about a B+ tree and its uses.
Explain the way of searching for data in a linked list.
Write down a brief note on the term iterative algorithm?
By using a declaration statement how is memory reserved?
Explain about the process management of operating system.
Explain about the priority queue?
Explain Tree database briefly.
Run Time Memory Allocation is termed as?
Illustrates the memory management in the operating system?
18,76,764
1960057 Asked
3,689
Active Tutors
1437848
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!