This max heap remove algorithm seems to make a two level jump. Is it correct?
While I was studying data structures on my own, I became curious about the remove algorithm in a binary heap. Here is the deletion algorithm for a max heap used in the textbook: