I really really like the way Tushar explains things, not giving out the code, but just the understanding one needs for the problem . Truly appreciate your effort @Tushar
I think it's wonderful that you took the time to go over the code. I'm much more happy to see that you explained both the recursive and iterative implementations of the functions. Thanks so much!
Wow. I just want to say thank you from the bottom of my heart. You are an amazing teacher. And you have no idea how much making these videos means to me. Thank you again
By far the best explanation for trie data structure. Thanks a ton for this video. What makes this video unique is the usage of sample strings to explain , which cover the corner cases.
Wow, I know more about deep software system analysis in a few minutes of listening to this man than all my time interacting with devs in almost 6 years.
+Tushar Roy - Coding Made Simple - I have a question at 12:55 Lets say, there is another word "cbc", which means that it will end at the node "c". Now we have two words '"abc" and " cbc". So when we delete the word "abc", we mark the node following "c" to false which would also delete "cbc". So how do we handle this scenario ?
"abc" starts with 'a' and "cbc" starts with c, so they will have different starting paths from the base root node. This situation will never occur. both will have an ending 'c' node, but these will be two different and independant nodes. Hope you understood! :)
This video has helped me a lot in understanding Tries. The concepts were well-explained and I was able to come up with my own implementation on C++ fairly easily. Thanks!
I feel the highlighted line @19:31 should be:return current.children.size() == 0 && !current.endOfWord;Imagine this case:Insert("ab");Insert("a");Delete("ab"); Your code will also delete "a"?
Thank you very much @Tushar Roy for this tutorial. You really did a good job, explaining it clearly. I was able to do the coding challenge on HackerRank that is of difficulty level Hard very easily.
There is a small bug in delete method. It should be "return !root.isEndOfWord && root.children.size() == 0;". Else that would delete all prefixed characters as well Thanks so much Tushor for everything that you do for us
Thanks for your useful labour here Tushar! I'd recommend getting a "lavalier" or just "lav" microphone; they're the ones that you clip onto your shirt's lapel. It would help the audio quality a _lot_, and make following the explanations a lot easier for international people who only know English as a second language. Lavalier mics are also relatively cheap compared to other kinds of microphone.
I really really like the way Tushar explains things, not giving out the code, but just the understanding one needs for the problem . Truly appreciate your effort @Tushar
Actually the code to the problem is in description box. But yes your point is commendable
Bro.. You're the best tutor i know man.. Thanks a lot...
Check Mr.Abdul Bari for Algorithms...He is More than Amazing..This guy is good too
If he is the best tutor you know, you really need to see the world ...
@@Yagamilight19383 stop comparing pagalo....
^^ This, Tushar is totally a friend.
@@Yagamilight19383 200% true..., yeah he is good but not the best...
It's 2020 and still this is best channel to learn data structures and algorithms.
Trie was used to one of the nightmares for me...because of your video it becomes so easy...thank you :)
one of the best tutorials i have seen on tries.
I think it's wonderful that you took the time to go over the code. I'm much more happy to see that you explained both the recursive and iterative implementations of the functions. Thanks so much!
this is a great piece. i am revisiting this video today after a year again
Wow. I just want to say thank you from the bottom of my heart. You are an amazing teacher. And you have no idea how much making these videos means to me. Thank you again
Thanks :) - I've learn trie before but needed a refresh
Best walkthrough of Trie I have ever seen.
You are the best data structure & algorithms instructor I have ever seen in my life.
Well I haven't went through all the videos about Trie yet but this is by far the best. Great work!
I cannot even say how thankful I am to you for making this video. Thank you very much! Great explaination.
Thank you so much Tushar literally watching your videos has helped me pass engineering and its still helping while working as a professional.
By far the best explanation for trie data structure. Thanks a ton for this video. What makes this video unique is the usage of sample strings to explain , which cover the corner cases.
Top notch. I've heard of trie but have never learned about it before.
This guy is really amazing at teaching new concepts
Simple and to the point explanation . Thankyou so much, your videos are really help full.
Excellent explanation!! When I find algorithm descriptions like this I feel I can reconstruct the code any moment ever. Thank you.
You have just made my day! Always feared of the word Trie, Now I feel very comfortable implementing it. Just Superb Job, Thanks
Thank you Tushar this is a great, well explained lecture
Sir, your explanation is very clear and easy, your video helps me to understand this topic in a very easy way!!.
Thank you😊
This is the best explanation of Trie, you really helped readers establish a proper mental model of this data structure and it’s implementation.
thanks sir . such a elegant explanation , easy to understand , better then one on gfg.
You are a good teacher and a good Developer
Wow, I know more about deep software system analysis in a few minutes of listening to this man than all my time interacting with devs in almost 6 years.
excellent video on tries. Never understood tries before watching this video!!
Great explanation. You missed to mark node "False" at 6:55, when inserting "d" value.
Thumbs Up!!! The examples you take to demonstrate the concept are quite good
explained in very easy way...very good Tushar
Simple and superb explanation..thanks tushar roy!!
Thanks @tushar. Your explanations are very easy to understand. it really help to learn quickly.
Great video and code, now I am clear about the TRIE
+Tushar Roy - Coding Made Simple - I have a question at 12:55
Lets say, there is another word "cbc", which means that it will end at the node "c". Now we have two words '"abc" and " cbc". So when we delete the word "abc", we mark the node following "c" to false which would also delete "cbc". So how do we handle this scenario ?
"abc" starts with 'a' and "cbc" starts with c, so they will have different starting paths from the base root node. This situation will never occur. both will have an ending 'c' node, but these will be two different and independant nodes.
Hope you understood! :)
+ Nitisha Sarin - Thank you for the explanation.
This is the best video in youtube for Trie data structure i have found!
this is superb, can't thank you enough dude, keep on uploading such quality content.
This video has helped me a lot in understanding Tries. The concepts were well-explained and I was able to come up with my own implementation on C++ fairly easily. Thanks!
Awesomely clear explanation. Thanks for sharing knowledge.
Best Video to understand the concept in detail
Great explanation @Tushar Roy
best video on trie ever and forever.
Thanks a lot man, I have always stayed away from Trie but now after watching your video it seems so easy. :)
I feel the highlighted line @19:31 should be:return current.children.size() == 0 && !current.endOfWord;Imagine this case:Insert("ab");Insert("a");Delete("ab"); Your code will also delete "a"?
叶子豪 i just thought about the same scenario.. thanks to your comment, i was able to validate my understanding as well..
its very good that you are at first explain then give a code its very good plz do that with other videos that you will be share
This is really awesome, long live Tushar!!
great way to explain the topics. crystal clear
Nice Explanation,
I save lot time to me in understanding this data structer.
Excellent! It doesn't get any better. Thank you for your explanation!
great intro to tries thank you, now to try this leetcode problem in python...
Thank you so much! This is the best tutorial on Tries. I really appreciate your efforts.
Very nice explanation! It really helps me understand the trie data structure!
Wonderful explanation and simple coding..
waited for this video . Thanks so much ...
Hello Tushar, I listen to your videos because I like your introduction "Hello Friends" Thanks for the videos
Thank you very much @Tushar Roy for this tutorial. You really did a good job, explaining it clearly. I was able to do the coding challenge on HackerRank that is of difficulty level Hard very easily.
Excellent video for understanding Trie implementation ! Thanks a lot !
Amazing explanation, thank you so much
Ek like to bnta hai tushar bhai k liye .sa b like kro bhai ka video
nice video. the videos which you present are really good..man..
Awesome explanation. Thanks a lot!
As always very helpful
You are a talent!!! good examples and excellent explanations
Very clear and simple explanation :) Thanks
Tushar bhai tussi great ho!
My trie is super clear after watching your video....thank you for creating this video:))....it would be great if you teach ternary search tree also...
Excellent Explanation. at 16:37 in video, in Insert method, node = current.children.get(ch) NOT current=node; this will fail at every first character.
Excellent explanation. I think this would be so easy to implement in a functional programming language like Haskell...will have to try thst
excellent explanation! your videos are really helpful
Beautiful explanation Tushar
Very helpful. Thanks a lot.
I like your videos: sufficient exemplar demonstrations and clear codes!
best explanation on trie
Awesome video!! Keep up the good work
Excellent.. Exactly like my notes
Great video ❤️
There is a small bug in delete method.
It should be "return !root.isEndOfWord && root.children.size() == 0;".
Else that would delete all prefixed characters as well
Thanks so much Tushor for everything that you do for us
A good simple to the point tutorial. Thx
Superb explanation!! Was waiting for this video. Thanks so much for taking out time!
Thanks Tushar, very good explanation.....video was very helpful!!
I love your videos. Thanks. You are the best.
Your explanations are very clear. Thank You for your efforts. Please make a video on Suffix Array.
Excellent explanation. Wish you had a iterative delete as well
Great explanation Tushar dada! you make things simple for new programmers :)
awesome man ... hats off to you
Wow. Really good explanation!
perfectly explained good job as always!
Make inner class TrieNode Static so that it does not require an instance of the outer class to be used. Amazing video!
That code was really beautiful man! Awesome!
Great tushar .. Keep it up
Why do we set current = node @16:37?
Very clear explanation Bro.
great videos.... it helped me alot....thnk you
nice explaination ! thanks
Such a good explanation!
Nice explanation, thanks for the video.
Nice and clear explanation. Thanks :)
Amazing explanation as always
Nice man.. short and sweet.
Thanks for your useful labour here Tushar! I'd recommend getting a "lavalier" or just "lav" microphone; they're the ones that you clip onto your shirt's lapel. It would help the audio quality a _lot_, and make following the explanations a lot easier for international people who only know English as a second language. Lavalier mics are also relatively cheap compared to other kinds of microphone.
Mind Blowing . The simplest explanation .