For this project, you will implement Huffman's greedy algorithm
for text compression and then write a brief report containing
the results of running your code on three books.
Complete the TODO's in HuffmanTree.java file and Driver.java.
-
Notifications
You must be signed in to change notification settings - Fork 0
IUDataStructuresCourse/lab-huffman-coding
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Lab about Huffman coding
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published