A max or min heap is a complete binary tree with the property that any node is greater (or smaller for min-heap) in value than its children

Example of a max-heap