The underlying data structure used by the computer during recursion is a:
A)queue
B)linked list
C)tree
D)stack

Question

Quizplus · Accepted Answer

The underlying data structure used by the computer during recursion is a stack. During recursion, each function call pushes its local variables and the return address onto a stack, and when the function returns, the values are popped off the stack. This creates a last-in, first-out (LIFO) arrangement of data, which is the definition of a stack data structure.

The Underlying Data Structure Used by the Computer During Recursion