Queues as a linear abstract data type

- [Instructor] Let's talk about what makes…the queue class unique especially in comparison to stacks.…Here's a high level definition of what a queue is.…Queues hold a collection of items…in the order in which they were added.…Items are added to the back of a queue…and removed from the front of the queue.…If you think of a queue as a line of costumers,…a customer adds themselves to the end of the line…and eventually leaves from the front of the line.…This is called first-in first-out or FIFO.…

Note that this is subtly different from stacks…which are last-in first-out.…Queues also preserve order so when you think…about people joining a line,…the order is preserved there as well.…Just as we did for the stack class,…we can see if there is a built-in data type we could use…to implement the queue behind the scenes.…Again, we can use a list because a list…is an ordered collection of items that we can modify.…When we code our queue class,…we're going to use the right side…or end of a list to represent the front of the queue.…