"# The Heap Sort Algorithm focuses mostly on the creation of what we call a “max heap”. What is a “heap”? \n", "# A heap is a special tree based data structures, with nodes that have children nodes.

"1. Max-Heap: In a Max-Heap the key present at the root node must be greatest among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that ...