This file compressor is based on the Huffman's coding algorithm, built with the following data structures:
- Hash Table
- Priority Queue
- Binary Tree
make file-compressor
Compiled at /output.
To compress a file:
./file-compressor.out compress -i input_file -o output_file
To decompress a compressed file:
./file-compressor.out decompress -i input_file -o output_file
This project contains unit tests for the data structures only.
First, compile the tests:
make tests
They are compiled separately by data structure at /output.
Then run a test like:
./output/binary_tree_tests.out