Class PriorityQueue

Internally heap Heap data structure is used to implement this queue.

// optional: compare function to determine the priority
// if not provided, priority is done simply with `a < b` operator 
const ds = new PriorityQueue(); 

ds.enqueue(1); 
ds.dequeue();