Huffman Tree Theory
<p>I have to implement a Huffman tree which encodes and decodes alphabetical chars from a to z.</p>

<p>The requirements are:</p>

<p>1) Read alphabetical chars from a file, print each char's frequency, build the Huffman tree, and print the coded chars. I have implemented it and it's working fine.</p>

<p>2) Write to a binary file the coded chars based to the Hufffman tree. Done.</p>

<p>3) Read from a binary file the coded char's separated by " " and print to the user which letter's is each binary code.
My lecturer said that I must not use the  Huffman tree from the 1st requirement, which I used by mistake.</p>

<p>Tell me theoretically, how can I find out which letter is each binary code?</p>
