More notes about new Huffman encoding algorithm

Some additional notes on the new Huffman encoding algorithm. The algorithm could be used to parallelize Huffman encoding of large alphabets because there is no dependency between left and right subtrees. At any given level of the full binary tree, all subtrees could be calculated at the same time using SUM(p), which is easily calculated in O(n).