add(num) {
    this.heap.push(num);
    this.heapifyUp();
  }
The minimalistic (ad hoc) version of a MinHeap data structure that doesn't have
external dependencies and that is easy to copy-paste and use during the
coding interview if allowed by the interviewer (since many data
structures in JS are missing).