Description: Hoffman coding, Huffman tree structure is very simple, all the nodes in a queue, replace the two lowest frequency node with a node, the new node and the frequency of frequency is the two nodes. So, the new node is two replaced node parent node. So the cycle, until the queue is only one node (Shu Gen).
To Search:
File list (Check if you may need any files):
Huffman.m
Download