j-zip v1.0.5

Summary: Based on Huffman's trees we can encode pieces of text into their binary traversal paths rather than their character codes. This requires a tree customised for the text to be compressed, as well as a binary string to traverse said tree. The aim of this project is to encode both the tree and the text to enable sending of a single file that can be interpreted to construct the tree and generate the decoded output.

Structure of a file: