Тёмный

Huffman Encoding 

Lalitha Natraj
Подписаться 39 тыс.
Просмотров 30 тыс.
50% 1

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.

Опубликовано:

 

9 июл 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 25   
@nitayhen3973
@nitayhen3973 Год назад
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!
@nelukabeer263
@nelukabeer263 2 года назад
VERY WELL EXPLAINED. THANK YOU!
@Oikawa754
@Oikawa754 26 дней назад
I started from ur first trie vid and it was sooo clear that i ended up here good job =]
@spikespiegel6440
@spikespiegel6440 2 года назад
You are really amazing! Thanks a lot! Make complicated things so clear and simple, You saved me.
@Sayo_03
@Sayo_03 Год назад
Thank you so much ,very helpful video ,very well explained.
@marvhartigan3677
@marvhartigan3677 Год назад
thanks for the crisp explanation
@shisanliu6314
@shisanliu6314 2 года назад
So good! Thanks!
@Zoronoa01
@Zoronoa01 2 года назад
Thank you so much!
@risperpeters5935
@risperpeters5935 2 года назад
Very helpful
@sovereignstandards
@sovereignstandards 2 года назад
Thank you ma'am
@amaanullah13
@amaanullah13 3 года назад
Thankyou Maam
@Whatthefuckiswrongwidyou
@Whatthefuckiswrongwidyou 4 месяца назад
You are the reason I graduated university.
@suryakanthpidugu475
@suryakanthpidugu475 2 года назад
Super.... Mam
@ricksanchez1527
@ricksanchez1527 Год назад
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?>>
@aaryanyadav3732
@aaryanyadav3732 7 месяцев назад
great
@abcd-xc2ix
@abcd-xc2ix 3 года назад
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
@dbdb7745
@dbdb7745 9 месяцев назад
how about decoding that trie?
@curie48
@curie48 4 года назад
This is really nice tutorial. Have a question. How do I reverse this to decode as abracadabra again?
@basabpriyobhattacharjee7566
@basabpriyobhattacharjee7566 2 года назад
For that, you will need to preserve either the tree or the table. Decoding without either of those isn't possible.
@maxdemian6312
@maxdemian6312 2 года назад
Traverse the tree according to the encoded string until you arrive at a leaf node and repeat
@aditipungalia8196
@aditipungalia8196 4 года назад
How did you decide binary terms 1,0 for last tree formed? Like how to give 0& 1 to the reach next node???
@Nizamuddinrazvivioce
@Nizamuddinrazvivioce 3 года назад
Give 1s to the right child and 0s to the left child
@SOHAILKHAN-iu8fu
@SOHAILKHAN-iu8fu 3 года назад
Give 1 to right Edge and 0 to left Edge of each node
@h3xrtboy779
@h3xrtboy779 2 года назад
@@SOHAILKHAN-iu8fu thx
@chienphung9633
@chienphung9633 Год назад
ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-iEm1NRyEe5c.html 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
Далее
3.4 Huffman Coding - Greedy Method
17:44
Просмотров 1,5 млн
Suffix Tries
7:17
Просмотров 114 тыс.
🤯 #funny
00:20
Просмотров 1,5 млн
Compressing text using Huffman trees worked example
15:48
Heaps
13:45
Просмотров 26 тыс.
Tries
9:40
Просмотров 130 тыс.
Dijkstra Algorithm
13:44
Просмотров 133 тыс.
Prim's Algorithm
7:18
Просмотров 549 тыс.
Dijkstra Algorithm - Example
13:04
Просмотров 144 тыс.
Compressed Tries
11:04
Просмотров 82 тыс.