Recursion Part-III

Lesson 9 of 10 • 0 upvotes • 8:07mins

Sourav Newatia

The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc. In thaa we cover the previous year of questions.