An Encoder for Huffman tree using 3 priority queues - MinBinaryHeap, Min 4-AryBinaryHeap and PairingHeap. The encoder reads an input file that is to be compressed and generates two output files – the compressed version of the input file and the code table.
-
Updated
Sep 21, 2017 - Java