Huffman tree help!
I want to write a program that is similar to the Huffman tree in that it only has the characters: lower case letters and the space. Your program should be able to receive a coded word i.e. 0011 01101 0110 might be the word dog. Also it should be able to receive a pharse and give the code: i.e. He wins might be 1101 10101 111 001 11010 01010. The user should be given the choice if they are going to enter a string or a code. It needs to be implemented using an array list or a linked list.
Re: Huffman tree help!
Do you have a question? What have you come up with so far?
I'm sure you don't expect anyone to do this for you. If you say what you've done and what has happened - compiler messages or runtime exceptions or unwanted output - then you will avoid giving the impression that this is a homework dump.