赫夫曼树： 按先序输入二叉树 数的结点是： 输入赫夫曼树的mm个权值： HuffmanCoding(HT,HC,&HT[mm].weight,mm) printf(HC,mm) -Huffman tree: sequence input by the first node is a binary number: Enter a Huffman tree mm Weight: HuffmanCoding (HT, HC, & HT [mm]. Weight, mm)

序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相应的递增下标序列为<2，3，5，7>。-Sequence Z = < B, C, D, B > is sequence X = < A, B, C, B, D, A, B > son sequence, the corresponding sequence for increasing subscr ipt < 2 consecutie hc-posit

构造霍夫曼树HT，将有n个叶子结点的哈夫曼树HT进行编码， 所编的码存放在HC中。