How to implement queue in JavaScript

1 Answer

0 votes
class Queue {
    constructor() {
        this.items = [];
    }
    
    enqueue(element) {
        return this.items.push(element);
    }
    
    dequeue() {
        if (this.items.length > 0) {
            return this.items.shift();
        }
    }
    
    size() {
        return this.items.length;
    }

    
    peek() {
        return this.items[this.items.length - 1];
    }
    
    isEmpty() {
       return this.items.length == 0;
    }
   
    print() {
        for (let i = 0; i < this.items.length; i++) {
          	console.log(this.items[i]);
      	}
    }
 
    delete(){
        this.items = [];
    }
}

let queue = new Queue();

queue.enqueue(2);
queue.enqueue(7);
queue.enqueue(3);
queue.enqueue(9);
queue.enqueue(0);
queue.enqueue(8);

console.log(queue.items);

queue.dequeue();
console.log(queue.items);

console.log(queue.peek());

console.log(queue.isEmpty());

console.log("size: " + queue.size());

queue.dequeue();
queue.print();

queue.delete();
console.log(queue.items);





/*
run:

[2, 7, 3, 9, 0, 8]
[7, 3, 9, 0, 8]
8
false
"size: 5"
3
9
0
8
[]

*/

 



answered Jan 28, 2022 by avibootz
...