Question

which data structure is used for recursion?explain​

Answer 1

Answer:

Explanation:

Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls

Answer 2

Explanation:

data structure used for recursion is Stack (LIFO) as the subsequent recursive calls are stored one by one from bottom to top as they are called and the stack top always holds the most recent function call.