CPP

min heap stl

priority_queue<int, vector<int>, greater<int>> pq;

min heap

priority_queue <int, vector<int>, greater<int>> g = gq;  
CPP

max heap

Step 1 − Create a new node at the end of heap.
Step 2 − Assign new value to the node.
Step 3 − Compare the value of this child node with its parent.
Step 4 − If value of parent is less than child, then swap them.
Step 5 − Repeat step 3 & 4 until Heap property holds.