Method delete

Data-Structures/Heap/MinPriorityQueue.js:112–124

()

  // deletes the highest priority value from the heap. The last
  // element goes to ahead to first position and reorder heap
  delete() {
    // checks empty and one element array conditions
    if (this.isEmpty()) return
    if (this.size === 1) {
      this.size--
      return this.heap.pop()
    }
    const min = this.heap[1]
    this.heap[1] = this.heap.pop()
    this.size--
    this.sink()
    return min
  }
}

export { MinPriorityQueue }