We are now going to create our own class to represent a queue. Let's start with the basics and declare our class:
class Queue { constructor() { this.count = 0; // {1} this.lowestCount = 0; // {2} this.items = {}; // {3} }}
First, we need a data structure that will store the elements of the queue. We can use an array to do it, just like we did for the Stack class in one of the examples in the previous chapter; however, we will use an object to store our elements ({3}); this will allow us to write a more efficient data structure when accessing its elements. You will also notice the Queue and Stack classes are very similar, just the principles for adding and removing the elements are different.
To help us control the ...
