js data stuct

stack

dequeue

priority-queue

优先队列

let isAdded = false
for(let i=0;i<queue.length;i++){
    if(element.priority< queue[i].priority){
        items.splice(i,0,element)
        isAdded = true
        break
    }
}

if(!isAdded){
  items.push(element)
}

circular-queue

循环队列

queue.enqueue(queue.dequeue)