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, specifically known as the call stack. Each function call is pushed onto the stack, storing information about that function's execution context, and popped off the stack when the function returns or when the recursion is complete. This creates a LIFO (last in, first out) structure that is best represented by a stack data structure.

The Underlying Data Structure Used by the Computer During Recursion