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 term overflow and underflow?
What do you mean by the node class?
Write down a brief note on the term iterative algorithm?
What are the differences between Recursive Case and Tail Recursion?
Define how to implement queue by using stack?
Define the isEmpty() member method.
What is the quickest sorting method to use?
What are the applications in which stacks are used?
Illustrates the recursive algorithm?
What is minimum number of queues required to implementing the priority queue?
18,76,764
1933597 Asked
3,689
Active Tutors
1444127
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!