Queue Implementation in JavaScript

queue.js

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


class Queue {
  constructor() {
    this.head = null;
    this.tail = null;
  }

  enqueue(value) {

    if(this.head == null) {
      this.head = this.tail = new Node(value);
    } else {
      let node = this.head;
      while(node.next != null) {
        node = node.next;
      }
      node.next = new Node(value);
      this.tail = node.next;

    }

  }


  dequeue() {

    let nodeToRemove = this.head;

    if(this.head == null) {
      return nodeToRemove;
    } else {
      this.head = this.head.next;
    }

    if(this.head == null) {
      this.head = this.tail = null;
    }

    return nodeToRemove;

  }


  print() {
    console.log("Head", this.head);
    console.log("Tail", this.tail);
  }


}


let q = new Queue();

q.enqueue(1);
q.enqueue(2);
q.enqueue(3);

q.dequeue();
q.dequeue();
q.dequeue();

q.print();