Queue Data Structure Example

queue.js

class Node {
    constructor(value) {
        this.value = value;
        this.next = null;
    }
}

class Queue {
    constructor() {
        this.first = null;
        this.last = null;
        this.size = 0;

    }
    enqueue(value) {

        const newNode = new Node(value);

        if (this.first) {

            this.last.next = newNode;
            this.last = newNode;
        } else {
            this.first = newNode;
            this.last = newNode;
        }


        this.size++;
        return this.size;
    }
    dequeue() {
        if (!this.size) return null;

        const removedNode = this.first;

        if (this.first == this.last) {
            this.last = null;
        }

        this.first = removedNode.next;
        this.size--;

        return removedNode.value;
    }
}