Build your intuition. Fill in the missing part by typing it in.

A heap tree is a special type of binary tree that satisfies the _ property.

For a max heap, for any given node, the value of the node is ___ the values of its children.

For a min heap, for any given node, the value of the node is ___ the values of its children.

A heap tree can be used to implement ___ queues.