Huffman Coding

Huffman coding is a lossless data compression algorithm. The idea is to assign variablelength codes to input characters; lengths of the assigned codes are based on the

frequencies of corresponding characters. The most frequent character gets the smallest

code and the least frequent character gets the largest code.

The variable$-$length codes assigned to input characters are Prefix Codes, means the codes

$($bit sequences$)$ are assigned in such a way that the code assigned to one character is not

prefix of code assigned to any other character. This is how Huffman Coding makes sure

that there is no ambiguity when decoding the generated bit stream.

In this project, you will be using a priority queue and a binary tree of your design to

implement a file compression$/$uncompression algorithm called "Huffman Coding