Description: Constructing a binary tree with n external expansion nodes, each external node has a Ki Wi corresponds, as the weight of the external node. This extension allows the leaf node of a binary tree with the sum of the minimum length path right outside: Min (W1* L1+ W2* L2+ W3* L3+ ...+ Wn* Ln) Wi: weight for each node. Li: distance the root node to the i-th external leaf nodes. Programming calculate the sum of the minimum external path length.
To Search:
File list (Check if you may need any files):
HUFFMAN CODING TREE.cpp
__MACOSX
........\._HUFFMAN CODING TREE.cpp
Download