Which data structure can be used to implement both stack and queue (only one data structure)*2 pointsStackQueueDequeueNone of the above

Break Down the Problem

1. Identify the data structure that can function as both a stack and a queue.
2. Consider the properties and methods associated with each type of data structure.

Relevant Concepts

• A stack follows the Last In First Out (LIFO) principle.
• A queue follows the First In First Out (FIFO) principle.
• A deque (double-ended queue) allows adding and removing elements from both ends, making it suitable for implementing both stacks and queues.

Analysis and Detail

1. A stack can be implemented using a deque by using the operations addFirst (push) and removeFirst (pop).
2. A queue can also be implemented using a deque by using the operations addLast (enqueue) and removeFirst (dequeue).

Verify and Summarize

A deque supports the necessary operations for both stack and queue functionalities. Therefore, it is the correct choice when a single data structure can fulfill both roles.

Final Answer

Deque is the data structure that can be used to implement both a stack and a queue.