Introduction - If you have any usage issues, please Google them yourself
Huffman tree structure tree哈弗曼no degree 1 nodes, is a standard binary tree, there is a leaf node n, the need for a length of 2n-1 one-dimensional array of storage哈弗曼tree nodes. (1), n a leaf node, only the right to weight the value of treatment of non-leaf node, from ht [i] (ht [1] ~ ht [n-1]) found in ht [i]. Weight minimum of two nodes ht [s1] and ht [s2], This is the Select (int n, int