Skip to content

The idea behind Huffman coding is based upon the frequency of a symbol in a sequence. The symbol that is the most frequent in that sequence gets a new code that is very small, the least frequent symbol will get a code that is very long, so that when we’ll translate the input we want to encode the most frequent symbols will take less space than t…

License

Notifications You must be signed in to change notification settings

HxnDev/Huffman-Encoding-Using-Binary-Trees

Repository files navigation

Huffman-Encoding-Using-Binary-Trees

There are 3 header files and 1 cpp file.

Header files are as follows: Tree.h, Vector.h, Queue.h

Whereas the cpp files is as follows: i180441_Assignment4.cpp

All the files have been commented for your ease. Furthermore you may also add further comments if you may. I have uploaded the Visual Studio project file too. You can simply run the project by running "i180441_AAssignment4.vcxproj".

Furthermore "temp1.txt, temp2.txt and temp3.txt" are simply some sample test cases I created to verify my solution

For better understanding of the scenerio, refer to "Requirements.md".

For further queries contact me at : chhxnshah@gmail.com

About

The idea behind Huffman coding is based upon the frequency of a symbol in a sequence. The symbol that is the most frequent in that sequence gets a new code that is very small, the least frequent symbol will get a code that is very long, so that when we’ll translate the input we want to encode the most frequent symbols will take less space than t…

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published