Which data structure is used to handle recursion in C?
a. Stack.
b. Queue.
c. Deque.
d. Trees.
Ans: Stack
Reason: 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.