Huffman\'s algorithm runs in O(n^2) time, where n is the number of symbols
For the above procedure, we use greedy approach, and according to previous
