A Huffman Tree (Huffman Tree) the definition of
First given n weights as n a leaf node, a binary Tree structure, if the Tree WPL weighted path length minimum, according to the binary Tree as the optimal binary Tree, also known as a Huffman Tree (Huffman Tree), Huffman Tree is the shortest Tree, weighted path length weight larger nodes are near the root, such as the following description of this kind of instance, through the distribution probability of student achievement, to know the students to find the frequency, then we need to design a kind of highest efficiency (that is, to find the time required) the smaller the depth=* frequency (ratio), we call such a Tree is the best Tree, which is our Huffman Tree (Huffman Tree),



, every brother please grant instruction