Huffman Encoding

preview_player
Показать описание
Video 82 of a series explaining the basic concepts of Data Structures and Algorithms.

This video explains the working of the Huffman encoding algorithm.

This video is meant for educational purposes only.
Рекомендации по теме
Комментарии
Автор

Superb explanation, I am learning so much from your videos! These concepts are easy to fathom but are explained very ambiguously in academic institutions. Cheers!

nitayhen
Автор

You are really amazing! Thanks a lot! Make complicated things so clear and simple, You saved me.

spikespiegel
Автор

Thank you so much, very helpful video, very well explained.

Sayo_
Автор

I started from ur first trie vid and it was sooo clear that i ended up here good job =]

Oikawa
Автор

why at 9:52 you take the charact b, 2 at the right hand side but at 11:45 you take the character at left hand side?>>

ricksanchez
Автор

As i know nd read lots ov time.. every new node is conected to the right side of parrent node. But u put on left side of parrent node.. plz clear confusion

abcd-xcix
Автор

This is really nice tutorial.

Have a question.
How do I reverse this to decode as abracadabra again?

curie
Автор

You are the reason I graduated university.

Whatthefuckiswrongwidyou
Автор

How did you decide binary terms 1, 0 for last tree formed? Like how to give 0& 1 to the reach next node???

aditipungalia
Автор

actually, your method is contradict to method in this video, while you put big frequency in the right, another person put it in the left. Therefore, i feel it confusing a lot

chienphung