Description: In the general data structure of the book, chapter and that the tree behind, the author will introduce the general Huffman (HUFFMAN) and Huffman coding tree. Huffman coding is an application of the Huffman tree. Huffman encoding applications, such as JPEG on the use of Huffman coding.
What is first introduced Huffman tree. Huffman tree is also called the optimal binary tree is a weighted length of the shortest path tree. The right tree with the so-called path length, is the tree of all the leaf nodes of the right value multiplied by its path length of the root node (root node is 0 if the layer of leaf nodes to root node of the path length for the leaf node layers). Tree path length with the right mind for the WPL = (W1* L1+ W2* L2+ W3* L3+...+ Wn* Ln), N a weight Wi (i = 1,2, ... n) constitute a trees have a N-leaf nodes of the tree, the corresponding leaf nodes of the path length for the Li (i = 1,2, ... n). Huffman tree can prove that the smallest of the WPL.
To Search:
File list (Check if you may need any files):
1.cpp
Download