Illustrates the data structures used to do recursion

Question

Illustrates the data structures used to do recursion?

Answer 1

Stack type data structures used to perform recursion. Due to its LIFO (Last in First Out) property this remembers its caller, so identifies whom to return while the function has to be return. Recursion utilizes system stack for storing the return addresses of the function calls. All recursive functions have its equivalent iterative as non-recursive function. Even if such equivalent iterative procedures are written, then explicit stack is to be used.