Compressed Tries 

I usually don't comment on videos but you're an exception, your videos are so didactic, congrats!

Very explict and clear. Thanks!

I really loved your videos, crystal clear, you saved me a lot of time. You have a lovely voice too. Subscribed!

Mam your lecture is stand out please make a playlist so every one get your lecture more easily.

amazing explanation, thanks !😄

Mam your lectures are good and specific try to advertise your channel so that many people can get the benefit of it as well as make a playlist of related topics so that exploration of particular topic can be easily done it will ultimately help u...thanks

Every informative and clear!! Thanks a lot :)

This is super helpful thank you

i don't comment on videos but you deserve way more subscribers than this. Great job and thanks for doing this.

superb explanation. thanks

Thank you so much 😊

Nice explanation..thank you maam🤩✨️

Subscribed! You are awesome!

Great class mam... Thanks a lot...

You deserve more reach

Really helpful Thankyou Mam 🥳🤩🤗

Your Voice 🙌❤️

Super ..very good

Clear voice ❤️

Will u plz make a vedio on binary trie,compress binary trie and Patricia

Mam ur just awesome

Thanku

Hi could you help me about Multi-index Hybrid Trie for IP Lookup and Updates?

Mam for 'o' node 2 children's hv know y we r taking into compressed tree mam

Awwww Such a Lovely Voice u Have 😍😘

You have a very nice voice....i love you❣

Mam b ,e also can be compressed know

How can we insert with binary numbers... Mam

Hi, I new here and your explanation is good on compressed Trie Data structure but could you please give any implementation regarding this data structure on C++ or C#

even the page line is exactly middle of video lol

from goodrich tamassia

Is sto is correct? Letter ‘o’ have two children

ries

Why "b" node is having 3 child nodes ?

maam your hand 🖐 🖐

kya mast awaz h neend aa gyi

College ❌ RU-vid ✅

Are you married

Your vice is orsm