Please help me with this question. Data structure

downheapmin: if the element on the heap is a grand-child of the selected node, then downheapmin is selected for that element. However, the category of elements on the heap is the child of the node which is swapped for their contents. downheapmax: Same process as downheapmin but the relational operators are reversed.

Give two examples of each!