I am little confuse whether huffman algorithm uses priority queue or sorted queue to build huffman tree? For example: https://www.geeksforgeeks.org/greedy-algorithms-set-3-huffman-coding/.
In the above link they are saying that use minimum heap but as i can see they have just used sorted list to make huffman tree.Please correct me if I am wrong.