We will not dig in-depth this article because our focus is to explain the Heap sort algorithm, not a heap. In the heap sort, the next smallest element is always the first element.The heap tree can be the two types - min-heap and max tree. A min-heap is kept a record of the ...