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 about linked list?
Define the term Arrays in brief?
Briefly describe the term Tree database. Elucidate its common uses?
Define the use of Direct Access in linked list instead of an array or vice versa.
Define the Armstrong rules.
Write down the various types of matrix operations?
State the difference between the Stack and Array?
Describe any two merits using single linked list over the doubly linked list and vice-versa?
Define the term threaded binary tree. Describe its common uses.
Elucidate the bubble sort algorithm?
18,76,764
1947405 Asked
3,689
Active Tutors
1433495
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!