A stack queue can be implemented as a
A) circular array
B) stack
C) dynamic linked list
D) dynamic vector
E) None of these

Question

Quizplus · Accepted Answer

A circular array is the best choice for implementing a stack queue as it allows for efficient access and addition/removal of elements at both ends of the queue. A stack or a dynamic linked list can only efficiently handle one end of the queue, while a dynamic vector may not have efficient access at both ends.

A Stack Queue Can Be Implemented as a