Vectormike

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

Vectormike

dequeue() {
  // Since it's FIFO, we point to the data in front
  let node = this.front;
  
  // Check if queue is empty
  if(!isEmpty()) {
    // move to the next data, and make it the first item in the queue
    this.front = this.front.next;
  }
  

Vectormike

class Queue {
  constructor() {
    this.head = null;
    this.back = null;
  }
  
  // Let us always check if the queue is empty before we do anything
  isEmpty() {
    return !this.head;
  }

Vectormike

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

Vectormike

if rear is equal to than 0
  print 'Queue is full'
  return true

else 
  return false

Vectormike

if front is greater than 0
  print 'Queue is empty'
  return true

else 
  return false

Vectormike

return queue[front]

Vectormike

if queue is empty
  print 'Queue is empty'
end

data = Queue[head]
head = head++
return data

Vectormike

if queue is full
  print 'Queue is full'
end

rear = rear++
Queue[rear] = data
return

Vectormike

// Returns the element at the top of the stack
this.peek = function () {
  if(this.isEmpty() === true) {
    console.log('Stack is empty');
    return;
  }
  return this.data[this.count - 1];
};