Another data structure Riely mentioned in class is the queue. The queue is a very simple data structure that carries with it the “first in, first out” approach where you’ll receive the elements in the queue in the same order that you placed them in.
Like stack’s push() and pop() methods, queue’s carry with them enqueue() and dequeue() methods that do the exact same thing for you. Like stacks, they carry with them other extremely useful methods.
Here’s a small illustration of the basics of queues and PLEASE remember to watch the video below for further insight: