Some irrelevant questions

[Chenyuanyuan299]

Hi, I'm learning how to implement heaps. Your heap implementation is very well written, but can you tell me in the extractRoot(), if the pop root == _leaf, _leaf will be the last node in _nodes, can it be directly assigned to null? What scenarios need to be assigned as this.root()?
next question, sort() will return a list in reverse order, and it mutates the node positions in the heap. This can be prevented in the code, can you tell me what you think?
Although it is a minor issue, I look forward to your reply, I would appreciate it. And I will provide a pr if necessary.