Huffman Coding

This is an implementation of Huffman Coding done in C.

Huffman coding is a lossless data compression algorithm that assigns shorter binary codes to more frequent characters and longer codes to less frequent ones. It builds a binary tree based on character frequencies, ensuring the most efficient encoding to reduce overall file size without losing any data.