A dynamic stack may be implemented as a(n) ________, and expand or shrink with each push or pop operation.
A) array
B) structure
C) linked list
D) A and B
E) None of the above

Question

Quizplus · Accepted Answer

A dynamic stack needs to expand or shrink with each push or pop operation, which requires a data structure that can dynamically allocate memory for new elements and release memory for removed elements. A linked list allows for such dynamic memory allocation as elements can be added or removed without requiring contiguous memory allocation. Arrays and structures, on the other hand, have a fixed size and cannot expand or shrink dynamically without significant overhead. Therefore, the best choice for implementing a dynamic stack is a linked list.

A Dynamic Stack May Be Implemented as A(n) ________, and Expand