Recursive Procedure – an overview

 Recursion is an important concept to understand when learning about data structures and algorithms. It describes a process where a function calls itself directly or indirectly. To better understand how recursion works with data structures, we must first define each term.

Data structures are the way in which information is organized and stored. This includes arrays, linked lists, binary trees, and many more, all of which are used to store information efficiently. Algorithms are processes which use data structures to accomplish tasks such as searching, sorting, etc.