Priority Queue in Javascript

pritority-queue.js

class Queue {
  
  constructor () {
    this.priority = [];
    this.regular = [];
  }
  
  enqueue(item, high = false) {
    if(high) {
      this.priority.unshift(item);
    } else {
      this.regular.unshift(item);
    }
    return(item);
  }
  
  dequeue(){
    if(this.priority.length > 0) {
      return this.priority.pop();
    }
    
    if(this.regular.length > 0) {
      return this.regular.pop();
    } else {
      return null;
    }
  }
  
  peak() {
    if(this.priority.length > 0) {
      return this.priority[this.priority.length - 1];
    } 
    
    if(this.regular.length > 0) {
      return this.regular[this.regular.length - 1];
    } else {
      return null;
    }
    
  }
  
  get length() {
    return this.priority.length + this.regular.length;
  }
}

let queue = new Queue();

console.log("length", queue.length);
console.log("enqueue", queue.enqueue("hello world..."));
console.log("length", queue.length);
console.log("peak", queue.peak());
console.log("enequeue", queue.enqueue("I'm important", true));
console.log("length", queue.length);
console.log("peak", queue.peak());
console.log("enqueue", queue.enqueue("another regular task"));
console.log("peak", queue.peak());
console.log("dequeue", queue.dequeue());
console.log("peak", queue.peak());
console.log("dequeue", queue.dequeue());
console.log("peak", queue.peak());
console.log("dequeue", queue.dequeue());
console.log("peak", queue.peak());