I created the gist on GitHub with three types of heaps: MinHeap, MaxHeap, and MedianHeap because I struggled a lot with solving the problems without having these data structures natively in the JavaScript language. If you do not wish to write it yourself you can just copy the needed data structure and solve the problem, but it would be better if you'll spend some time to understanding how the code works