Description: The main points of this trial is the process of establishing the Huffman tree, this algorithm is the idea of:
1) based on N weights given by {W0, W1,...... The Wn-1} structure, n tree has only one root node of the two fork tree, the two tree into a forest F={T0, T1,...... , Tn-1}.
2) in the forest F as left, right subtree merge into a new two fork tree selection two tree root node of the minimum weight of two binary tree, and the weight of the root node of the tree the new two fork tree weights equal to the left, the right sub tree nodes. As a result, the forest was reduced to a tree.
3) repeat the previous step, until the forest F only a two binary tree, the two binary tree is to get the Huffman tree
After the two fork tree establishment, to store the data by creating a file is divided into static and dynamic storage mode, by displaying the data in the file to check if the data is stored in the file, the Huffman tree in the left branch said all 0, all right branch 1, branch based
To Search:
File list (Check if you may need any files):
c.txt
Download