Breaking News: Grepper is joining You.com. Read the official announcement!

implement queue using stack javascript

saumya dua answered on July 26, 2022 Popularity 9/10 Helpfulness 2/10

answer implement queue using stack javascript

related how to build a queue using stacks js

implement queue using stack javascript

Comment

function Queue() {
  this.queue = {};
  this.tail = 0;
  this.head = 0;
}

// Add an element to the end of the queue.
Queue.prototype.enqueue = function(element) {
  this.queue[this.tail++] = element;
}

// Delete the first element of the queue.
Queue.prototype.dequeue = function() {
  if (this.tail === this.head)
      return undefined

  var element = this.queue[this.head];
  delete element;
  return element;
}

Popularity 9/10 Helpfulness 2/10 Language javascript

Source: www.telerik.com

Tags: javascript queue stack using

Link to this answer
Share Copy Link

Contributed on Jul 26 2022

saumya dua

0 Answers Avg Quality 2/10

Closely Related Answers

how to build a queue using stacks js

Comment

class CrazyQueue {
  constructor() {
    // Initialize two stacks to represent the queue
    this.stackNewOnTop = []; // Newest elements are at the top of this stack
    this.stackOldestOnTop = []; // Oldest elements are at the top of this stack
  }

  // Add an element to the back of the queue
  enqueue(value) {
    console.log("we enqueued " + value);
    return this.stackNewOnTop.push(value);
  }

  // Transfer elements from stackNewOnTop to stackOldestOnTop if necessary, and remove the oldest element from the queue
  dequeue() {
    if (this.stackOldestOnTop.length === 0) {
      // If stackOldestOnTop is empty, transfer elements from stackNewOnTop to stackOldestOnTop to reverse the order
      this.shiftStacks();
    }
    console.log("we dequeued " + this.stackOldestOnTop.pop());
  }

  // Peek at the oldest element in the queue without removing it
  peek() {
    if (this.stackOldestOnTop.length === 0) {
      // If stackOldestOnTop is empty, transfer elements from stackNewOnTop to stackOldestOnTop to reverse the order
      this.shiftStacks();
    }
    return this.stackOldestOnTop[this.stackOldestOnTop.length - 1]; // Return the top element of stackOldestOnTop
  }

  // Transfer elements from stackNewOnTop to stackOldestOnTop to reverse the order of elements in the queue
  shiftStacks() {
    const length = this.stackNewOnTop.length;
    for (let i = 0; i < length; i++) {
      this.stackOldestOnTop.push(this.stackNewOnTop.pop());
    }
  }

  // Print the contents of the two stacks (for debugging purposes)
  printer() {
    console.log("this is the stack with newest in front : " + this.stackNewOnTop);
    console.log("this is the stack with oldest in front : " + this.stackOldestOnTop);
  }
}

// Test the CrazyQueue class
const myQueue = new CrazyQueue();
myQueue.enqueue(14);
myQueue.enqueue(12);
myQueue.enqueue(11);
console.log("Peek: " + myQueue.peek()); // should output 14
myQueue.dequeue();
myQueue.enqueue(22);
console.log("Peek: " + myQueue.peek()); // should output 12
myQueue.dequeue();
myQueue.dequeue();
console.log("Peek: " + myQueue.peek()); // should output 22
myQueue.dequeue();
myQueue.enqueue(22);
myQueue.enqueue(242);
myQueue.dequeue();
myQueue.enqueue(22);
myQueue.dequeue();

console.log(myQueue);

Popularity 7/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: build javascript javasc

Link to this answer
Share Copy Link

Contributed on Apr 04 2023

Ameer Jamal

0 Answers Avg Quality 2/10

implement queue using stack javascript

Contents

More Related Answers

implement queue using stack javascript

Closely Related Answers

how to build a queue using stacks js

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.