Description: Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree
To Search:
- [Huffman] - The use of Huffman coding to achieve the
- [chuxuedanpianji] - This is a beginner Singlechip experiment
- [bc7281] - ATmega16-based source of BC7281 keyboard
- [huffman] - Classic Huffman algorithm, in this case,
File list (Check if you may need any files):
Download