Data structures used to perform recursion

Question

Which one data structures used to perform recursion?

Answer 1

Stack. Due to its Last in First out (LIFO) property this remembers its 'caller' that knows whom to return while the function has to return. Recursion utilizes system stack for storing the return addresses of the certain function calls.
All recursive functions have its equivalent iterative (i.e. non-recursive) function. Even though such equivalent iterative processes are written, explicit stack is to be utilized.