Final answer:
A max heap is a complete binary tree in which each element is greater than or equal to both of its children.
Step-by-step explanation:
A max heap is a complete binary tree in which each element is greater than or equal to both of its children.
In a max heap, the root node contains the highest value in the tree, while the child nodes have values that are smaller or equal. The property that each node is greater than or equal to its children is known as the heap property.
For example, suppose we have a max heap with the values: [10, 7, 6, 4, 3, 2]. The root node is 10, and both of its children 7 and 6 are smaller or equal. Similarly, for each other node, its value is greater than or equal to both of its children.