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 way of searching for data in a linked list.
Name the data structures which are used to perform the recursion?
Define the term a spanning Tree.
Write some of the disadvantages of the sequential storage?
What are the dvantages of single linked list over doubly linked list?
What do you mean by the term matrix? Describe its uses with an illustration.
Write down the differentiation between NULL AND VOID pointers?
Briefly describe the term B+ tree? Elucidate its uses?
What is known as error tracking?
Describes the uses of Tree Database?
18,76,764
1931715 Asked
3,689
Active Tutors
1438384
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!