Implementation of Queue Data Structure

The Queue class represents a custom implementation of a queue data structure in JavaScript. It provides methods to perform basic queue operations, such as adding elements to the back of the queue (enqueue) and removing elements from the front of the queue (dequeue).

The queue is a linear data structure that follows the First-In-First-Out (FIFO) principle, meaning the first element added to the queue will be the first one to be removed. The example demonstrates how to create an instance of the Queue class and perform enqueue and dequeue operations on it.