To DownHeap (sifting down) we compare the parent node to its children to check it the heap property is upheld. If that is not the case, we swap the parent with one of its childrens and then recursively apply this until we reach a leaf.

This process is needed whenever we remove an entry from the Heap.