Hey dude, keep it up,,, I have already mentioned your channel to our college's progrraming club,,, soon enough they all will be following you :) Your videos are very nice, and clearly explained :)
Nice work😀 But examples should have uneven length strings. Example like Soap Soapy This explain empty character role Example like Hat Hammer Would have explained trie well. Anyways thanks😊 and keep going😀.
If the original list of words to be added to the trie changes, how do we propagate the changes to the trie? One possible way is we can do a diff of the new list with the old list to get the updates, additions and removal. Then perform those change related operations. For updates(an existing word changed), we can simply delete the word first and add the updated word. But is there a more efficient way to do this?
your video is not blurry but something else...its not clearly visible.. I dont know if its a camea problem.. try to avoid the above light and use some dark pen.
Hey Saif, thanks for the feedback! Yes, I tried to improve the video quality and the software made the lighting too bright. Will keep these points in mind for the future :-)
Hi Aarsh, that is an interesting question. Technically every pointer we use is just keeping an address integer, so yes it is possible. But there are two main challenges: 1) The tree is not a complete binary tree, like a segment tree. So there will be many empty spaces at the last level. Especially since has trie has multiple branches. 2) It will get unnecessarily complicated. :-)
Dushyant Singh I think container.hpp will not work in most of the programming competitions & websites. Not Ideone not even SPOJ. we have to implement using Structures and pointers
sir i am working on a project called mathematical information retrieval.My guide told me to use the above data structure.But sir i did not found video on this ds.plz sir make video on it
Tries used to one of the most dreadful topics in data structure for me and then I came across this video. Thanks Gaurav, you're the best
Thanks Aashish!
Please continue doing what you are doing as it is very important for an average coder like me to jump to an advanced coder
Thanks Arghya!
Thanks for taking the time to make this video. Your explanation is clear and made something complicated simple.
Seriously love your videos. Difficult concepts made easy.
Hello brother. Your videos are too much helpful. Please, make videos of such rare topics. We learn a lot from you.
Thanks Ashik!
@@gkcs Thambi...u look like my younger brother...unfortunately...he is no more now...I felt very bad
Love your enthusiasm while teaching bro :)
Hi Guys!
I will be adding a video explaining the code for Tries today. Hopefully, we will solve a problem along the way!
do u upload second part of video today??
Yup
I am not able to find implementation part
You can find the complete Trie Series Here: th-cam.com/video/p4kfbNJzftQ/w-d-xo.html
@@gkcs The most efficient data structure used for implementing routing table is?????
The video is easy to understand and make the concept clear🙂
Thank You, That insert and delete db entry thing was awesome. Keep updating us, bro!
Hey dude, keep it up,,, I have already mentioned your channel to our college's progrraming club,,, soon enough they all will be following you :)
Your videos are very nice, and clearly explained :)
Thanks Neer!
Very nice explanation!
I think introducing the null root at the beginning of the tutorial would have made it more clear and less confusing.
Nice work😀
But examples should have uneven length strings.
Example like
Soap
Soapy
This explain empty character role
Example like
Hat
Hammer
Would have explained trie well.
Anyways thanks😊 and keep going😀.
Thanks Shaurya!
Thanks for making the video.. it is really very helpful :)
Thanks Ayushi!
As always, Great job! Keep this going!
Thanks Divyansh!
Awesome explanation!
Really awesome video......aho corasik algorithm, please.
If the original list of words to be added to the trie changes, how do we propagate the changes to the trie?
One possible way is we can do a diff of the new list with the old list to get the updates, additions and removal. Then perform those change related operations. For updates(an existing word changed), we can simply delete the word first and add the updated word.
But is there a more efficient way to do this?
Well explained Thanks.
Thanks for the explanation. What exactly is a multi way tree? What are the other kind of trees?
so handsome the teacher , plus smart !
your video is not blurry but something else...its not clearly visible.. I dont know if its a camea problem.. try to avoid the above light and use some dark pen.
Hey Saif, thanks for the feedback! Yes, I tried to improve the video quality and the software made the lighting too bright.
Will keep these points in mind for the future :-)
is there any way to implement this without pointers? and structures in cpp
Hi Aarsh, that is an interesting question. Technically every pointer we use is just keeping an address integer, so yes it is possible. But there are two main challenges:
1) The tree is not a complete binary tree, like a segment tree. So there will be many empty spaces at the last level. Especially since has trie has multiple branches.
2) It will get unnecessarily complicated. :-)
Dushyant Singh I think container.hpp will not work in most of the programming competitions & websites. Not Ideone not even SPOJ. we have to implement using Structures and pointers
12:50 and if you have 2 children there? delete both of them?
Please can you make the implementation video on this topic...
th-cam.com/video/p4kfbNJzftQ/w-d-xo.html
Sir,how to implement trie using cpp??
specially with STL??i cant able to build a tree using stl,plz help me sir
can u plz make a video on aho corasick algorithm as it takes linear time, its very important concept
awesome
Thanks!
good one, thnx
You should begin with the actual usage- at least a use case where this makes more sense
Lmgtfy.
Nice
What do u mean by ckcs
very well explained bhaii.. but BC mujhe ye samajh nahi ataa ye algo banane waale itana sab soch kaise lete hai :D :D :D ...
thanks
Video quality is not good!
means video clarity is not there
Blur
Really? I can see at 360p also. Try to improve the resolution.
🔥🔥🔥
i am in intermediate to programming bhai can u provide some source so that i can learn more about graphs and trees
Yo. look at the energy!.
Huffman tree is an example of Binary trie😂
niceu! very niceu!
Please clean your camera lens.
sir plz make video on patricia trie and radix trie...plzz
Why? Where are they used?
sir i am working on a project called mathematical information retrieval.My guide told me to use the above data structure.But sir i did not found video on this ds.plz sir make video on it
pritam das Ask him why should you do it and what it does. Please make an effort in understanding the why before starting the how.
👍
:)
Pro tip: Watch at 2x
why so many dislikes
2.14
:)
your video is not clear
Please elaborate.
Bro I can't see🤣
这不是陈坤吗
谢谢你的夸奖