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.
Write down a brief note on the term recursive algorithm?
Elucidate pre-order and in-order tree traversal?
Explain binary tree?
Explain the difference between a stack and a Queue.
Explain about the direct call to ISR by an interrupting source.
Explain about the priority queue?
Write down the various types of algorithms?
Describe the term iterative algorithm?
Specify the methods which are available in the storing sequential files?
Briefly describe the term merge sort algorithm?
18,76,764
1955082 Asked
3,689
Active Tutors
1412012
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!