Huffman Encoding

Поділитися
Вставка
  • Опубліковано 26 гру 2024

КОМЕНТАРІ • 27

  • @gamumhere6885
    @gamumhere6885 10 днів тому

    you are saving my life right now, thank you for your videos and clear explanations

  • @nitayhen3973
    @nitayhen3973 2 роки тому +5

    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!

  • @spikespiegel6440
    @spikespiegel6440 2 роки тому +3

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

  • @nelukabeer263
    @nelukabeer263 2 роки тому +9

    VERY WELL EXPLAINED. THANK YOU!

  • @ricksanchez1527
    @ricksanchez1527 Рік тому +1

    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?>>

  • @Sayo_03
    @Sayo_03 2 роки тому +1

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

  • @Oikawa754
    @Oikawa754 6 місяців тому

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

  • @marvhartigan3677
    @marvhartigan3677 Рік тому

    thanks for the crisp explanation

  • @adityashekharsingh2669
    @adityashekharsingh2669 22 дні тому

    nice explaination

  • @abcd-xc2ix
    @abcd-xc2ix 4 роки тому +1

    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 Рік тому

    how about decoding that trie?

  • @aaryanyadav3732
    @aaryanyadav3732 Рік тому

    great

  • @curie48
    @curie48 5 років тому +3

    This is really nice tutorial.
    Have a question.
    How do I reverse this to decode as abracadabra again?

    • @basabpriyobhattacharjee7566
      @basabpriyobhattacharjee7566 3 роки тому

      For that, you will need to preserve either the tree or the table. Decoding without either of those isn't possible.

    • @maxdemian6312
      @maxdemian6312 2 роки тому +1

      Traverse the tree according to the encoded string until you arrive at a leaf node and repeat

  • @Zoronoa01
    @Zoronoa01 2 роки тому

    Thank you so much!

  • @shisanliu6314
    @shisanliu6314 2 роки тому

    So good! Thanks!

  • @aditipungalia8196
    @aditipungalia8196 5 років тому

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

  • @sovereignstandards
    @sovereignstandards 2 роки тому

    Thank you ma'am

  • @suryakanthpidugu475
    @suryakanthpidugu475 3 роки тому

    Super.... Mam

  • @risperpeters5935
    @risperpeters5935 2 роки тому

    Very helpful

  • @amaanullah13
    @amaanullah13 3 роки тому

    Thankyou Maam

  • @chienphung9633
    @chienphung9633 2 роки тому

    ua-cam.com/video/iEm1NRyEe5c/v-deo.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