Question

What is recursion in data structure?

Answer 1

Some computer programming languages allow a module or function to call itself. This technique is known as recursion. In recursion, a function α either calls itself directly or calls a function β that in turn calls the original function α. The function α is called recursive function.

Answer 2

The procedure in which a capacity calls itself straightforwardly or in a roundabout way is called recursion and the relating capacity is called as recursive capacity. Utilizing recursive calculation, certain issues can be explained effectively. Instances of such issues are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph .

In recursive program, the answer for base case is given and arrangement of more serious issue is communicated as far as littler issues.