Hi basically I've exhausted my mind looking for resources and help on the Huffman Tree Coding. This is my problem, there are 2 parts to what I have to do, the first done:
1. Given a text file, determine the frequency of each character in the text (map of
character and frequency)
Next comes the optimal Huffman tree:
2. Build an optimal huffman tree to represent these characters with these
frequencies (maintain a priority queue of trees, removing and joining trees until
only one tree remains – the final Huffman tree required) Hint: each Hoffman
Tree might have a weight data member, as wellas a pointer to its root node.
I've literally no idea how to go about implmenting this, I understand trees and the Huffman tree, but when it comes to implmenting it I'm lost!! Could anyone help?