Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
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.
Related threads:
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.
Reply With Quote