What is advantages of recursion in a data structure?

Answer 1

Recursive procedures are huge memory hogs. Also, they're a nightmare to debug. Finally, it's pretty rare to find an application that actually needs recursion as opposed to a simpler, more friendly methodolgy.

Answer 2

In computer science, recursion is the reference of a function to itself. In general, recursion simplifies the programmer's task by saving a certain amount of code, thus making it more compact. It can also simplify the appearance of a program. A classical example of recursion is the C function for n! which contains the assignment nfact=f(nfact-1);

where f is the name of the function andnfact is the value of the factorial being computed.The mathematical form of this assignment is simplyn!=n(n-1)! .

Recursion also has its disadvantages. It can hamper debugging and slow down complicated computing processes. When a process can be done either by recursion or by iteration, the latter should usually be preferred.

Answer 3

Dynamic programming is a computer science methodology that uses previous choices or decisions to formulate the next solution. The main limitation to this type of coding is keeping track of previous decisions and partial choices that may be applied to a future answer.

Answer 4

Demerits of recursion are:

Many programming languages do not support recursion; hence, recursive mathematical function is implemented using iterative methods.

Even though mathematical functions can be easily implemented using recursion, it is always at the cost of execution time and memory space.

The recursive programs take considerably more storage and take more time during processing.

Answer 5

Recursion

Advantage

i. Usually simplicity.

ii. Although at most of the times a problem can be solved without recursion, but in some situations in programming, it is a must to use recursion. For example, a program to display a list of all files of the system cannot be solved without recursion.

iii. The recursion is very flexible in data structure like stacks, queues, linked list and quick sort.

iv. Using recursion, the length of the program can be reduced.

Disadvantage

i. It requires extra storage space. The recursive calls and automatic variables are stored on the stack. For every recursive calls separate memory is allocated to automatic variables with the same name.

1. Often the algorithm may require large amounts of memoryif the depth of the recursion is very large. If the programmer forgets to specify the exit condition in the recursive function, the program will execute out of memory.
2. The recursion function is not efficient in execution speed and time.
3. Some function calls inside recursion are repeated or duplicated just like fibonacci

Answer 6

To perform recursion the data structure 'stack' is used.

Stack has LIFO(Last in First out) property and it remember it's 'caller'.

Therefore, when the function has to return it knows to whom it should return.

Recursion makes use of the system stack for storing the return addresses of the fn calls.

Every recursion fn has its equivalent non-recursive function.

When such equivalent non-recursive fn procedures stack is to be used to perform recursion.

Recursive relation ships if exists then function coding becomes easy.

Because of repeated recursion, we may enter into stack overflow problem. To avoid this we try to see that the recursive relation can be realized tail recursive manner. In direct recursion for each one activation frame will be created from the stack area of our process, thus it may lead to stack overflow situation. When we realize in tail recursive manner, with one activation record or stack frame itself we can get the results.

Answer 7

You cannot have recursion within a data structure. Recursion applies to functions and compile-time computation (template metaprogramming).

The following is an example of recursion in a data structure:

typedef struct object {

struct object data;

};

This won't compile because the declaration of object is incomplete at the point we declared the data member. It has a cyclic dependency that, if allowed, would recurse into infinity. That is, in order to instantiate an object, we must first instantiate the object.data member. But that data member is itself an object, so we cannot instantiate it until we've instantiated object.data.data, and object.data.data.data, and so on into infinity.

To break the cyclic dependency we have to use a pointer to the type rather than an instance of the type:

typedef struct object { struct object* data_ptr;

};

Note that we can point to incomplete types because a pointer is a complete type, even if the type it points to is incomplete. This is because the pointer is not instantiated until we instantiate an object of the type, and we can only do that when the type is complete:

struct object obj; // instantiate an object

obj.data_ptr = &obj; // assign the address of the object to its own data pointer

The above is an example of a self-reference, not an example of recursion.

struct object obj2;

obj.data_ptr = &obj2;

obj2.data_ptr = &obj;

In this example, the two objects are pointing to each other. Again, this is non-recursive.

We can also copy a member pointer to a non-member pointer via a member pointer:

struct object* p = obj.data_ptr->data_ptr;

Again, not recursive! Note that p is now pointing at obj, not obj2.

Answer 8

answer ede bey

Answer 9

Yes.