The count is then constructed into a binary tree using the Huffman algorithm to generate an optimized bit length coding.

• 然后，将该次数数字转化成二进制树状结构，再运用霍夫曼运算法则生成经优化的位长编码。