Huffman Coding

[@孙博-g1v]

Excellent. A slow-pace and clear explanation. And there is another point we need to notice when building the binary tree, which is implicitly expressed in your video, that is when we implement Huffman Coding using heap, we always attach the smaller tree to the bigger tree.

[@IDeserve]

Thanks a lot for your encouraging feedback. The observation you have made is perfectly valid. Thank you for that. Cheers, Team IDeserve

[@sharvitomar3809]

The entire I-Deserve series of videos is amazing.You have truly become my fav!

[@IDeserve]

Thanks Sharvi for your kind words :) We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@sharvitomar3809]

Yes ,yes.Thats what I have been recommending to everyone I know!Keep up the good work .You'll soon be a big hit :)

[@hajerahmed9209]

great explanation you are the best tutor ever

[@IDeserve]

Thanks Hajer!

[@Joekapia]

Excellent explantation thank you for getting my head around this, exam's in two days!

[@IDeserve]

Thanks joekapia and All the Best for your exams :) We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Thanks, -Team IDeserve.

[@IDeserve]

Hey Joekapia, If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI Thanks, -Team IDeserve.

[@IDeserve]

Dear Friends, If you like our content and would like us to continue making great content for you, please spread the word about IDeserve. A share/appreciation from you on social network would mean the world to us! Also, do like our Facebook page: facebook.com/IDeserve.co.in :) Thanks, -Team IDeserve.

[@GokulRG]

Thank you so much.. well taught!

[@IDeserve]

Thanks Gokul :) We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@IDeserve]

Hey Gokul, If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI Thanks, -Team IDeserve.

[@SameekBanerjee]

There is also the advantage that huffman code is a prefix coding scheme. This ensures no ambiguity when we are decoding from a stream of bits. Other than that great explanation.

[@IDeserve]

+Sameek Banerjee Thanks for your great input. The use of binary tree to generate codes for input symbols ensures that the codes generated are 'prefix-free' codes which as you have pointed out helps in unambiguous decoding. At first, we wanted to cover that aspect as well but then we decided against it because we wanted to cover the main algorithm in this video. Probably in the next video of Huffman Coding Series, we will try to cover that aspect as well. Cheers, Team IDeserve

[@anamikaahmed4887]

Best tutorial I came across so far.Alhamdulillah.. And keep up the good work.We need more of these to improve our grades :) Love from Bangladesh!

[@IDeserve]

Thank you so much Anamika for your kind words :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Online Code Submission, Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@IDeserve]

Hey Anamika, If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI Thanks, -Team IDeserve.

[@falakk22]

Cheers to your enthusiastic way of explanation , Thanks .

[@IDeserve]

Cheers to the encouragement you have shown towards IDeserve!

[@MbahAgis]

great explanation sir.. you make me learn huffman encode algorithm easier

[@IDeserve]

Thanks Dionysius for your kind words :) If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@jahanvikhedwal1107]

Amazing explanation..Keep making such videos!!!!!!!!!!

[@IDeserve]

Thanks Jahanvi for your kind words :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@shubhamlokhande5556]

ossam explanation sir , Thank u so much..:-)

[@GokulRG]

"ossam" comment sir

[@IDeserve]

Thanks Shubham :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@IDeserve]

Hey Shubham, If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI Thanks, -Team IDeserve.

[@bunyway]

Question, so is 58 and 63 is the total size of the compressed data or it is only the length of bits but it will be summed with something else? I mean we do compress the string into binary but is there space required to store for example in the Huffman Coding, is the binary tree stored too so that 58bits + binary tree size? or in fixed-length, the symbol is stored in order so 63 + 8*CHAR_BIT_SIZE. To simplify, how this symbol thing stored and how much it affect the file size? I mean to store a binary tree which contains more char in each node is more than just to store ordered char.

[@prashantshubham]

Great video, but description is wrong,Time complexity: O(nlogk) is the case where k is no. of alphabets symbols in text given also O(n) will be only in the case when input is already sorted.

[@MounikaBanoth]

best explanation

[@IDeserve]

Thanks :)

[@dailycomputerscience]

Excellent :-*

[@IDeserve]

Thanks Flix for your kind words :) We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@TheCougsPlays]

good explanation :)

[@IDeserve]

Thanks eGr :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@IDeserve]

Hey eGr, If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI Thanks, -Team IDeserve.