One operation that we might want to implement on a stack and a queue is full, which determines if the data structure has room for another item to be added. This operation would be useful
A) only if the queue or stack is implemented using an array
B) only if the queue or stack is implemented using a linked list
C) only for a queue
D) only for a stack
E) None of these; a full operation is not useful at all

Question

Quizplus · Accepted Answer

The full operation is particularly useful when the stack or queue is implemented using an array because arrays have a fixed size, and it's important to know when the array is full to prevent overflow. In contrast, linked lists can dynamically grow, so the concept of being "full" is not as relevant.

One Operation That We Might Want to Implement on a Stack