In this chapter, you learned about the queue data structure. We implemented our own algorithm that represents a queue; you learned how to add and remove elements from it using the enqueue and dequeue methods. We also covered two very famous special implementations of the queue: the priority queue and the circular queue (using the Hot Potato game implementation).

In the next chapter, you will learn about linked lists, a more complex data structure than the array.