Which of the following data structures is used in implementing recursive calls?

Recursive calls are implemented using a stack data structure because of the Last-In-First-Out (LIFO) behavior needed for managing function call frames. Each invocation adds a frame to the stack, which is popped upon return.