Queue with array

circularQueue.js

// Queue 구현
// Stack 구현
// Stack 2개로 Queue 구현

class Queue {
  constructor() {
    this.size = 5;
    this.array = [];
    this.front = 0;
    this.rear = 0;
  }

  push(val) {
    if(this.isFull())
      return false;

    if(this.rear === this.size)
      this.rear = 0;
    else {
      this.array[this.rear] = val;
      this.rear++;
    }
  }

  pop() {
    if(this.isEmpty())
      return false;

    if(this.front === this.size)
      this.front = 0;
    else {
      this.array[this.rear] = 0;
      this.front++;
    }
  }

  isEmpty() {
    return this.front === this.rear;
  }

  isFull() {
    if(this.front < this.rear)
      return (this.rear - this.front) === this.size;
    else
      return this.front + 1 === this.rear;
  }

  peek() {
    return this.array[this.front];
  }
}

let myQ = new Queue();