Tries

129,653
0
Published 2019-05-02
Video 78 of a series explaining the basic concepts of Data Structures and Algorithms.

This video introduces the concept of tries.

This video is meant for educational purposes only.

All Comments (21)
  • @pastafarian8410
    I grappled with this particular algo for long time but finally you explained it clearly Lalitha. Cheers
  • @harshsaxena356
    Watching you writing and explaining was so satisfying 😌. Amazing explanation 💯
  • @aryansaxena4014
    I love this concept, the way you explained the topic. I was searching for the video of this topic for my exam. Thank you so much !!!! for this video
  • @LilyEvans1996
    Thank you for this amazing explanation! I am curious though, could we not have a word that is a prefix of another word still? Let's say we have a boolean value in our Node class that is set to true if the node is an end of a word. So in the case of autocomplete, when we type b it would first try to guess that we are trying to spell be, but if we continue spelling and type bea it would suggest the next complete word which would be bear.
  • @GitaGhasemi
    You explained it perfectly. Thank you so much.
  • @venkatasreeram
    Well explained sister ❤️ very much understood ! THANK YOU ☺️
  • @jaddadzakaria
    clean explaining thanx for the help and wishing you great day or night
  • @omsai.n
    I cleared the subject because of you thanks
  • @mbv22311
    does the list need to b sorted before inserting into the trie
  • @nikiita04
    Thank you mam for this amazing explanation 😊
  • @sammrt7741
    at last i understood it ! thanks alot . great explaining