Create a Huffman tree using the alphabetical characters and frequencies in text file. Encode user input string by traversing huffman tree to find the desired character and generating Huffman code. Decode Huffman code by traversing tree with given code to find the corresponding character.