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
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
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 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.
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.
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.
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
Awesome video. However, there is one error in the code : While returning inside if(shouldDeleteCurrentNode) , it should be return current.children.size() == 0 && !current.endOfWord; Basically, if a word is ending at this node, then we shouldn't delete this node. Consider for example if we insert "jayesh" and "jay" in the trie and delete "jayesh", it would delete both the strings which is incorrect.
Thanks for the amazing video. You are doing a great job and I really appreciate your effort. Your videos helped me a lot. Although this is very trivial, I would like to point out that in the code provided, If there are "abc" and "ab" in the Trie, after removing "abc", the search for "ab" return false. Again thanks for the video.
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!
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.
Hey Tushar, Once again great video and thanks for sharing with all. I had one doubt in delete the word in Trie as you are checking for current.children.size() == 0 which is not going to be true when you have 2 or more characters starting at root node. Eg: 'Alpha' & 'Beta' root Trie node will have 'A' and 'B' both at the root which means the currentmap.childred.size() will not be 0. Please share your thoughts about this. Thanks.
I will leave it here in case anybody else stumbles upon this problem. We have to add one more check in this case (I use JavaScript): // return true if no mappings are left in the map and endOfWord is false return !current.endOfWord && current.children.size === 0;
Hi @tushar. Code correction: delete method code has a small bug. private boolean delete(String word, TrieNode current, int index){ if(index==word.length()){ if(current.isEndOfWord){ return false; } // if there are NO children, it will tell the parent to delete itself current.isEndOfWord=false; return current.children.size()==0; } char ch = word.charAt(index); TrieNode node = current.children.get(ch); if(node==null){ return false; } boolean selfDelete = delete(word, node, index+1); if(selfDelete){ current.children.remove(ch); *if(current.isEndOfWord==false){* return current.children.size()==0; } } return false; }
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"?
+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! :)
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...
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
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
Trie was used to one of the nightmares for me...because of your video it becomes so easy...thank you :)
Best walkthrough of Trie I have ever seen.
It's 2020 and still this is best channel to learn data structures and algorithms.
I cannot even say how thankful I am to you for making this video. Thank you very much! Great explaination.
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!
Thank you so much Tushar literally watching your videos has helped me pass engineering and its still helping while working as a professional.
Excellent explanation!! When I find algorithm descriptions like this I feel I can reconstruct the code any moment ever. Thank you.
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.
Thanks :) - I've learn trie before but needed a refresh
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.
Simple and to the point explanation . Thankyou so much, your videos are really help full.
Great explanation. You missed to mark node "False" at 6:55, when inserting "d" value.
Top notch. I've heard of trie but have never learned about it before.
great intro to tries thank you, now to try this leetcode problem in python...
Great explanation @Tushar Roy
You are a good teacher and a good Developer
This guy is really amazing at teaching new concepts
You have just made my day! Always feared of the word Trie, Now I feel very comfortable implementing it. Just Superb Job, Thanks
Sir, your explanation is very clear and easy, your video helps me to understand this topic in a very easy way!!.
Thank you😊
Thumbs Up!!! The examples you take to demonstrate the concept are quite good
excellent video on tries. Never understood tries before watching this video!!
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.
this is superb, can't thank you enough dude, keep on uploading such quality content.
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
Awesome video. However, there is one error in the code :
While returning inside if(shouldDeleteCurrentNode) , it should be return current.children.size() == 0 && !current.endOfWord;
Basically, if a word is ending at this node, then we shouldn't delete this node.
Consider for example if we insert "jayesh" and "jay" in the trie and delete "jayesh", it would delete both the strings which is incorrect.
Good catch!
This is really awesome, long live Tushar!!
Thanks @tushar. Your explanations are very easy to understand. it really help to learn quickly.
Thanks for the amazing video. You are doing a great job and I really appreciate your effort. Your videos helped me a lot.
Although this is very trivial, I would like to point out that in the code provided,
If there are "abc" and "ab" in the Trie, after removing "abc", the search for "ab" return false.
Again thanks for the video.
if (i == input.length()) {
if (!current.endOfWord) {
return false;
} else if(current.children.size() > 0) {
current.endOfWord= false;
}
return current.children.size() == 0;
}
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 the best video in youtube for Trie data structure i have found!
Awesomely clear explanation. Thanks for sharing knowledge.
explained in very easy way...very good Tushar
thanks sir . such a elegant explanation , easy to understand , better then one on gfg.
As always very helpful
Thank you Tushar this is a great, well explained lecture
Excellent! It doesn't get any better. Thank you for your explanation!
Ek like to bnta hai tushar bhai k liye .sa b like kro bhai ka video
Simple and superb explanation..thanks tushar roy!!
best video on trie ever and forever.
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.
Best Video to understand the concept in detail
Very helpful. Thanks a lot.
Superb explanation!! Was waiting for this video. Thanks so much for taking out time!
Thanks a lot man, I have always stayed away from Trie but now after watching your video it seems so easy. :)
Hello Tushar, I listen to your videos because I like your introduction "Hello Friends" Thanks for the videos
Nice Explanation,
I save lot time to me in understanding this data structer.
Very nice explanation! It really helps me understand the trie data structure!
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!
great way to explain the topics. crystal clear
Great video and code, now I am clear about the TRIE
Excellent video for understanding Trie implementation ! Thanks a lot !
Make inner class TrieNode Static so that it does not require an instance of the outer class to be used. Amazing video!
waited for this video . Thanks so much ...
best explanation on trie
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...
Thank you so much! This is the best tutorial on Tries. I really appreciate your efforts.
You are a talent!!! good examples and excellent explanations
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.. Exactly like my notes
Great video ❤️
This is the best explanation of Trie, you really helped readers establish a proper mental model of this data structure and it’s implementation.
Wonderful explanation and simple coding..
nice explaination ! thanks
Amazing explanation, thank you so much
Awesome explanation. Thanks a lot!
Hey Tushar,
Once again great video and thanks for sharing with all. I had one doubt in delete the word in Trie as you are checking for current.children.size() == 0 which is not going to be true when you have 2 or more characters starting at root node. Eg: 'Alpha' & 'Beta' root Trie node will have 'A' and 'B' both at the root which means the currentmap.childred.size() will not be 0. Please share your thoughts about this. Thanks.
I will leave it here in case anybody else stumbles upon this problem. We have to add one more check in this case (I use JavaScript):
// return true if no mappings are left in the map and endOfWord is false
return !current.endOfWord && current.children.size === 0;
Great explanation Tushar dada! you make things simple for new programmers :)
excellent explanation! your videos are really helpful
Your explanations are very clear. Thank You for your efforts. Please make a video on Suffix Array.
Beautiful explanation Tushar
Hi @tushar.
Code correction: delete method code has a small bug.
private boolean delete(String word, TrieNode current, int index){
if(index==word.length()){
if(current.isEndOfWord){
return false;
}
// if there are NO children, it will tell the parent to delete itself
current.isEndOfWord=false;
return current.children.size()==0;
}
char ch = word.charAt(index);
TrieNode node = current.children.get(ch);
if(node==null){
return false;
}
boolean selfDelete = delete(word, node, index+1);
if(selfDelete){
current.children.remove(ch);
*if(current.isEndOfWord==false){*
return current.children.size()==0;
}
}
return false;
}
siraa bai
Very clear and simple explanation :) Thanks
nice video. the videos which you present are really good..man..
Excellent explanation. I think this would be so easy to implement in a functional programming language like Haskell...will have to try thst
nice explanatory video
Great tushar .. Keep it up
best tutorial on trie.
That code was really beautiful man! Awesome!
Awesome explanation. Thanks a lot for your videos !
Thanks Tushar, very good explanation.....video was very helpful!!
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..
I keep waking my computer screen when this video goes to a next section lol
+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.
A good simple to the point tutorial. Thx
Tushar bhai tussi great ho!
You are my life teacher
Very good video
Amazing explaining! Thank you so much!
perfectly explained good job as always!
Thanks a lot, Tushar!
Awesome video!! Keep up the good work
awesome man ... hats off to you