I don't see the necessity of this detail. Isn't the solution immediate from the Huffman Compression - that the lowest frequency tab gets 1111111 and the highest bits tub gets 0?
Date: 18 Jun 2015 07:59
Number of posts: 3
RSS: New posts
and if the lowest frequency equal to the highest frequency? what then?
If all the counts are the same, than you have a (more or less, depends on the number of chars) balanced tree, with all codings (more or less) of the same length.