[Feature]: Implement Huffman Coding Compression Algorithm with Tree Visualizer

[nivedha2025cse-gif]

Feature Name

Huffman Coding Algorithm and Tree Generation

Feature Description

Implement the Huffman Coding text compression algorithm. The feature should take a text input string from the user, generate the frequency table, construct the binary tree, output the compressed binary code string, and render the resulting Huffman Tree visually on screen.

Motivation

Greedy algorithms and data compression are core parts of advanced computer science curriculums. Huffman coding bridges the gap between text manipulation, tree structures, and greedy choices perfectly.

Implementation Suggestions (Optional)

Write the tree construction logic using a priority queue. For the tree layout UI, look into using SVG elements or a library like D3.js / react-flow to draw the tree nodes and connecting edges cleanly.

Feature Type

New Algorithm

Does this feature require additional resources?

• Additional Documentation
• Third-Party Libraries
• UI/UX Design
• Other

References (Optional)

@ajay-dhangar kindly assign this to me

[Pranav-0440]

Hi @ajay-dhangar , i would like to work on this issue, Could you assign it to me??