Ideas for a new algorithm to produce Huffman coding. The secret is in recursively generating the full binary tree by building the left and right subtrees for recursive halves of the sorted probability distribution of the symbols.
Each subtree should have an amount of nodes proportional to the probability sum of it's corresponding half of the probability distribution.
1. Proportion subtree nodes to halves of the probability distribution.
2. Proportion subsubtrees to halves' halves.
3. Repeat until done.