Can you go through this code and explain what is going on in each step? thank you. //created :: priority_queue minHeap; // function to build

Can you go through this code and explain what is going on in each step?

thank you.

//created ::

priority_queue, compare> minHeap;

// function to build the Huffman tree and store it in minHeap void Utils:: HuffmanCodes(int size){ struct HuffNode *left, *right, *top; for (map::iterator v=freq.begin(); v!=freq.end(); v++) minHeap.push(new HuffNode(v->first, v->second)); while (minHeap.size() != 1) { left = minHeap.top(); minHeap.pop(); right = minHeap.top(); minHeap.pop(); top = new HuffNode(NULL, left->freq + right->freq); top->left = left; top->right = right; minHeap.push(top); } storeCodes(minHeap.top(),""); }