A Max Heap is a complete binary tree where every parent is larger than its children. The maximum element is always at the root, giving O(1) access to the largest value.
Every node satisfies: parent ≥ children. The root always holds the maximum. Same array representation as min heap — only the comparison flips.