The underlying data structure used by the computer during recursion is a:

A) queue
B) linked list
C) tree
D) stack

Underlying Data Structure

The specific arrangement or organization of data in memory that supports the implementation and functionality of higher-level data types or structures.

Recursion

Recursion is a programming technique where a function calls itself in order to solve a problem by breaking it down into smaller, more manageable problems.

Stack

A data structure that follows the Last In, First Out (LIFO) principle, where the last element added is the first one to be removed.