Which data structure is applied when dealing with a recursive function?

Question

What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

Answer 1

Recursion, which is basically a function that calls itself based on a terminating condition, makes use of the stack. Using LIFO, a call to a recursive function saves the return address so that it knows how to return to the calling function after the call terminates.