Binary Trees and Huffman Coding

Huffman coding is a way to do lossless compression. Details can be found at: https://en.wikipedia.org/wiki/Huffman_coding For this lab you will be given a file that has been encoded. You need to decode it.

Objectives

1. Learn to work with binary trees
2. Learn about Huffman coding
3. Improve your recursion skills

Assignment

Phase 1:

1. Turn in the software design report as a pdf by the due date specified on Canvas.

Phase 2:

1. Implement your designs
2. Test and debug your code

Submission instructions for Phase 2

1. Complete the SDR.
2. Combine your SDR and all of your .java and testing files into one zip folder
3. Submit the zip folder on Canvas by the due data specific there.

Restrictions:

• You may not use any Internet resources (other than to look up Java syntax).
• You may use code from this course or last semesters.