> For the complete documentation index, see [llms.txt](https://mr-poston-1.gitbook.io/c++/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mr-poston-1.gitbook.io/c++/4.-2d-vectors-stacks-and-queues/4.5-queues/4.5.1-queues.md).

# 4.5.1 Queues

In This lesson, you are going to explore another data structure, the **Queue**. Queues are very similar to stacks with one notable exception. Data in a stack is managed last-in, first-out (LIFO), but in a queue the data is managed *first-in, first-out*. (FIFO)

Like a stack, queues can store a list of items and you have limited access to the members of the queue.