Learning JavaScript Data Structures and Algorithms - Third Edition

Inserting a value into the heap

Inserting a value into the heap is performed by adding the value at the bottom leaf of the heap (the last position of the array— {1}) and then performing the siftUp method ({2}), meaning we will swap the value with its parent until its parent is smaller than the value being inserted. The sift up operation is also called up head, percolate up, bubble up, heapify up, or cascade up.

The code to insert a new value into the heap is presented as follows:

insert(value) {
  if (value != null) {
    this.heap.push(value); // {1}
    this.siftUp(this.heap.length - 1); // {2}
    return true;
  }
  return false;
}