DATA STRUCTURE - RECURSION BASICS Some computer programming languages allows a module or function to call itself This technique is known as recursion
We will take only a superficial look at recursion in this course since it provides a very neat way to represent certain useful numerical functions and data
What is the data structures used to perform recursion? Ans: Stack Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to
performed, using as few resources, both execution time and memory space, Some of the more commonly used data structures include lists, arrays, stacks,
What is the data structures used to perform recursion? Stack Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return
memory needed to store data and the kind of data that will be stored in that memory location What is the data structures used to perform recursion?