You can implement queues with:
Linked list: enqueue and dequeue, but more memory overhead.
Circular array: amortized, more cache-friendly. In practice, use the built-in: C++ has queue, Python has collections.deque (use append and popleft), Java has Queue interface with LinkedList. Don't implement from scratch in contests. Use the standard library. Time: . Space: .