Heap sorting diagram

Large root heap: all nodes are greater than or equal to the left and right child nodes
Small root heap: all nodes are less than or equal to the left and right child nodes
Insert picture description here
Graph source network

Guess you like

Origin blog.csdn.net/qq_46620129/article/details/113802043