Tries

preview_player
Показать описание
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.
Рекомендации по теме
Комментарии
Автор

I love the setup. Red in contrast with white paper. Just amazing!!!

abhijeetkushwaha
Автор

I grappled with this particular algo for long time but finally you explained it clearly Lalitha. Cheers

pastafarian
Автор

Watching you writing and explaining was so satisfying 😌. Amazing explanation 💯

harshsaxena
Автор

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

aryansaxena
Автор

You explained it perfectly. Thank you so much.

GitaGhasemi
Автор

Well explained sister ❤️ very much understood ! THANK YOU ☺️

venkatasreeram
Автор

Only 18 secs in the video. And fell in love with your handwriting

VY-ztph
Автор

Thank you all your explonation, IT IS AMAZING!!!!

oleksandrvoichyshyn
Автор

you are sooo clear! thanks so much for ur videos

rosameliacarioni
Автор

clean explaining thanx for the help and wishing you great day or night

jaddadzakaria
Автор

Thank you so much didi aapne toh exam bacha liya, such a clear explanation ❤❤❤

sureshshukla
Автор

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.

LilyEvans
Автор

I cleared the subject because of you thanks

omsai.n
Автор

Sweet voice and superb explaination. :)

ashishjadhav
Автор

at last i understood it ! thanks alot . great explaining

sammrt
Автор

Thank you mam for this amazing explanation 😊

nikiita
Автор

for inserting bell, L was inserted . Then comes second L, you said if it finds the letter it won't insert. So how does it distinguishes?

stephenfernandesoct
Автор

Not sure if I understood the note. What is meant by this? Any can explain further?

helloworldcsofficial
Автор

mam there will no duplication in the trees so no need to write l second time

yogeshnaidu
Автор

does the list need to b sorted before inserting into the trie

mbv