Thoughts on implementing a custom Priority Queue in TS

LC 1046

My two cents:

Each push and pop requires a rearrangement of the existing elements, it's almost like the priority queue is a living organism which evolves / devolves it self to maintain the order of the elements.

Swap, BubbleUp, & BubbleDown are the methods doing the main lifting. Here, swap is the simple swap operation

const temp: T = this.heap[i];