Min Heap function C++

void minHeap(Node* p);//8 points

//Recall that in a Min Heap, at all nodes, //value(parent)<= value(l_child) and value(parent) <= value(r_child).

//This function re-structures the tree, whose root is pointed by p, into a Min Heap.

//You are required to use recursion.