Max Heap Python

It is the complete binary tree within which each value in every internal node is >= to the values within the children of this node.

Mapping the elements of a heap within an array implies trivial, if any node is saved an index k, later its left child is saved at index 2k + 1 also its right child is saved at index 2k + 2.