JavaScript Data Structures - 10 - Queue Implementation Optimised 

Excellent

There is small bug on this implementation. I have written a piece of code which will give inappropriate result. queue.enqueue("data1") queue.dequeue() queue.dequeue() qeue.enqueue("data1"); queue.dequeue(); To Solve this issue just need to apply conition in dequeue method : const item = this.items[this.front]; if(!item) return // this is the line to correct the bugs delete this.items[this.front]; this.front++; return item;

thak you

Lovely

Does JavaScript have any in-building queue data structure, like cpp has

Is it a problem that the head and tail never reset? Obviously it would defeat the purpose if you had to update every key value pair at enqueue or dequeue. That begin said, depending on your use case it might not be a bad idea to have a private reset method that resets the head and tail to 0 if the queue ever completely empties.

Size isnt equal to tail - head +1 ??

this is my implementation, not sure if this works for queue class Queue { constructor() { this.items = {}; this.size = 0; } enqueue(element) { this.items[this.size] = element; this.size++; } dequeue() { if (this.size) { const item = this.items[0]; delete this.items[0]; this.size--; return item; } } peek() { return this.items[0]; } isEmpty() { return this.size === 0; } size() { return this.size; } clear() { this.items = {}; this.size = 0; } print() { console.log(this.items); } }

Don't you think so in this way the length of array will be increased?. All the elements from start will be assigned to undefined and size of array will increase by adding new values?

Excerllent

There is no check in dequeue for rear >= front. Hence, if we try to dequeue an empty object, won't it cause error and set the pointers wrongly.

I smell bugs.