A queue is an ordered, first-in-first-out data structure. Typical implementations of queues support pushing elements to the back and popping them off the front position.
- A queue is not limited to a fixed capacity
- A bounded queue is a queue limited to a fixed number of items
- A
doubly linked listis a good implementation choice
Operations
- enqueue - pushes an element to the end of the queue
- dequeue - pops an element from the front of the queue
