A Dequeue (double-ended queue) is a linear data structure open at both its ends.
In a dequeue, elements can be added or removed from both the front and the back of the queue, making it a versatile data structure for implementing both stack (if elements are added/removed from one end only) and queue (if elements are added/removed from both ends) operations.
So, the correct answer is:
Dequeue
