Week Beginning 05/03/01

Mr. T Lysaght

(You can download template files from the course homepage at:

http://www.cs.may.ie/~tlysaght/CS211/CS211Lectures.html.

1. Build an optimal code tree using Huffman Coding with the following code symbols and associated probabilities.

1. Alter the classes TreeNode.java and BinarySearchTree.java by adding/altering class members and methods to implement Huffman coding. Rename the class BinarySearchTree.java as Tree.java, renaming constructors where appropriate.

 

2. Save the class template files Path.java and Forest.java to the same directory as TreeNode.java and Tree.java. These files can be located at:

http://www.cs.may.ie/~tlysaght/CS211/CS211Lectures.html.

Add the appropriate code to these template class files.

3. Write a driver program Huffman.java which constructs a code tree from the above symbols and probabilities. Print the code tree and symbols with their codes.