A quick tutorial on generating a huffman tree. Lets say you have a set of numbers and their frequency of use and want to create a huffman encoding for them: Creating a huffman tree is simple.
Sort this list by frequency and make the two-lowest elements into leaves, creating a parent node with a frequency that is the sum of the two lower element's frequencies: The two elements are removed from the list and the new parent node, with frequency 12, is inserted into the list by frequency. So now the list, sorted by frequency, is:
UNIX. Protocols & networks. GPU Computing. Cloud computing. Big Data 2012. OpenERP.