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.
Illustrates the recursive algorithm?
What are the applications where stacks are used?
Define when we should use plain list.
Illustrates the disadvantages of circular linked list over linear linked list?
Define the fastest sorting method to use?
What do you mean by recursive algorithm? Describe in brief.
How is doubly linked list used?
Explain binary tree in brief.
Which one data structures used to perform recursion?
Explain how spiral model works?
18,76,764
1944193 Asked
3,689
Active Tutors
1433999
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!