Huffman Tree

A simple program to implement Huffman tree and generate corresponding message codes using the min-heap keyed with frequencies. Output should display the message code for each frequency as well as the total weighted path length for the tree. Frequencies should be run for the French and German alphabets from the below link https://static.hlt.bme.hu/semantics/external/pages/bigramok/en.wikipedia.org/wiki/Letter_frequency.html