[REQUEST] Add Huffman Coding in cpp

Algorithm Name

Huffman Coding

Programming Language

C++

Category

Greedy Algorithms

Difficulty Level

Medium (Intermediate)

Algorithm Description

Huffman Coding is a clever method for compressing data by assigning variable-length codes to characters based on how frequently they appear. Common characters get short binary codes, while rare characters get longer ones, similar to how 'E' is a single dot in Morse code. The algorithm builds a special binary tree by repeatedly merging the two least frequent characters until a single tree is formed. By traversing this tree, a unique, prefix-free code (where no code is the prefix of another) is generated for each character, resulting in an overall smaller file size.

References (Optional)

No response

Contribution Intent

• I would like to implement this algorithm myself
• I'm requesting this for someone else to implement
• I need help implementing this algorithm

Code of Conduct

• I agree to follow this project's Code of Conduct