I am writing a program to compress a text file using huffman trees.
I realized that if the tree is of a level greater than or equal to eight, there will be no compression occurring.
Do I have to limit the size of the trees? Do I have to make a tree for every 32 bits or something?