Description: Huffman tree is also called the optimal binary tree is a weighted shortest path length binary tree. The so-called weighted path length tree is the tree of all the weights of leaf nodes to root node multiplied by the diameter of its length (if the root node is 0 level, leaf nodes to root node of the path length of leaf node layer). Weighted path length tree recorded as WPL = (W1* L1+ W2* L2+ W3* L3+ ...+ Wn* Ln), N a weight Wi (i = 1,2, ... n) constitute an N-lobe node binary tree, the corresponding leaf nodes of the path length Li (i = 1,2, ... n). WPL Huffman tree can be shown is the smallest.
To Search:
File list (Check if you may need any files):
HUFMM.doc
Download