Compressing text using Huffman trees worked example 

I have no idea why but I always prefer just good old pencil and paper (in this case a sharpie) demonstration. I don't need a bunch of effects for something like this. And it feels like someone's right there with you showing you something cool.

Absolutely the finest example of the Huffman encoding algorithm!

Best video on the YT on huffman. Hats off to you sir.

Thankyou Sir, I am a computer engineering student. Your videos are very valuable for us

simply the easiest explanation on huffman coding..Thank you sir

most correct huffman tutorial on youtube

Fantastic ! Thank you, Sir !

You helped a lot thanks sir.

This really helped. Thanks.

So much thank you, so clear !!

Thanks ! this helped me sooo much :)

a lot of thanks dear

Thanks

very crispy and direct walkthrough, thank you Mr. D. A note of caution for future productions though: your |s and |s look identical. (See what I did there?)

thanks :)

got to use acronyms like that thnks

Thanks sir my test is tomorrow

8:54 = the titles of the things 10:19 = How many bits there are in the encoded message

Big Huffa ftw

King

let's assume instead of sp being 3, it was 5 (ignoring the rest of the characters with higher frequencies for now), then would we still have done n+sp which would be 2+5=7, or would we add 4+n which would add up to 6?

Do capital small letter should be consider different?

at the end of the video, you talked about decoding it again which was "BOB IS BIG" how did you get the binary bits of this message???

where did the number 7 come from ?? pls anyone help me.. 10:30

this is not the best method because it is only for elements that add together to an even number, if there are an odd number of elements there are actually better huffman trees that compress more

pee