JavaScript Program to Implement a Queue

A queue is a data structure that follows the First In First Out (FIFO) principle.

The first element added to the queue is the first one to be removed. This is like being in a queue to get a movie ticket. The first one in the queue gets the ticket first.

Example: Implement Queue

Output

Queue after adding items: 
{ '0': 8, '1': 6, '2': 4, '3': 2 }
Queue after deleting the first item:
{ '1': 6, '2': 4, '3': 2 }
First item of the queue = 6
After clearing the queue: 
{}

In the above program, the queue data structure is implemented using the object. The Queue class is created to implement the queue data structure. The class includes methods like enqueue(), dequeue(), peek(), isEmpty(), size(), and clear().

A Queue object is created using a new operator and various methods are accessed through the object.

• Initially, this.items is an empty object which is treated as a queue.
• The enqueue() method adds elements to the queue.
• The dequeue() method removes the first element from the queue.
• The peek() method returns the first element from the queue.
• The size() method shows the total number of elements in the queue.
• The isEmpty() method returns a boolean checking if queue is empty or not.
• The clear() method clears and resets the queue.