Method pop

Data-Structures/Heap/KeyPriorityQueue.js:55–61

* Removes the element with least priority * @returns the key of the element with least priority

()

   * @returns the key of the element with least priority
   */
  pop() {
    this._swap(0, this._heap.length - 1)
    const key = this._heap.pop()
    this.priorities.delete(key)
    this._shiftDown(0)
    return key
  }

  /**
   * Checks whether a given key is present in the queue