In all of the previous problems for Heaps in JavaScript, the recommended solutions involved using sorted arrays to essentially "simulate" a Heap.

So my solution to the problem involved an insertion function that inserted to a min heap array. To retrieve the median, I simply calculated the middle element of the array (or middle 2 if the array length was even).

This solution seems so much simpler to me and had WAY less code than the recommended solution. I realize this isn't like, the "Heap" solution, so writing out an entire Heap class might help better with long term understanding of Heaps but this seems so much less complex to me. Someone want to point out where I'm wrong here?

class Solution {
  constructor() {
    this.nums = [];
  }

  insertNum(num) {
    let index = this.nums.length;
    this.nums.push(num);
    while (index > 0 && this.nums[index - 1] > num) {
      this.nums[index] = this.nums[index - 1];
      this.nums[index - 1] = num;
      index--; 
    }
  }

  findMedian() {
    const midPoint = Math.ceil(this.nums.length / 2) - 1;
    if (this.nums.length % 2 === 0) {
      return (this.nums[midPoint] + this.nums[midPoint + 1]) / 2;
    } else {
      return this.nums[midPoint];
    }
  }
}