Recursive algorithms are especially useful in manipulating data structures that are themselves defined recursively. Whenever a data object is defined recursively, it is often easy to describe algorithms that work on these objects recursively. Though all the languages, such as BASIC, COBOL, and the like, do not have the recursive facility, however, all new programming languages use recursion as their primary iterative control structures. If our programming language does not allow recursion, that should not matter because we can always translate a recursive programme into a nonrecursive version. C language has an inherent property to use recursion. We will show the readers how the recursion can be implemented through C language. So ...

Get Data Structures Using C now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.