Huffman Coding

The idea of this algorithm is to construct a tree for every symbol where symbol that occurred more consume less bits. On the other hands, symbol that occurred least consumed more bits