i've been going through a lot of youtube videos to understand trie , suddently i stumbled up on this video , and i understanded it well , thank you brother ,love you from india
Very good explanation and very educational video... Keep up the great work! What would be the most efficient way to count total number of words in Trie? I managed to do that, but I called does_word_exist at the beginning of add_word and I was incrementing the counter if it is the first appearance of the word, but that method slows down algorithm a lot... Thanks in advance!
Really helpful video. Can you explain why you used self.root = {"*":"*"}? I wasn't able to find much information on using an asterisk inside a dictionary. Thank you!
you would use an array/hashmap/dictionary to collect the children, then if you want to access any given child you would use the child itself as the index for the array. e.g. for child 'a' you could do something like array[asciivalue('a')] which would then access the a node. so it's effectively self indexing as long as the array can contain all expected values from a to z
i've been going through a lot of youtube videos to understand trie , suddently i stumbled up on this video , and i understanded it well , thank you brother ,love you from india
thank you, this video is very much appreciated!!!
Was very helpful, thank you for putting in the time to make such an excellent video.
Can you tell me which code is more faster out of these two
Great work thanks for the efforts
nicely done
Thank you for creating this video.........
thanks for the vid man.
you are a legend . view and sub doesn't always represent a good video .
Great Explanation ! kindly help us with deletion too, covering all the cases.
this was pretty interesting!
11:00 Why does it not work when add_word is being used as an independent function?
Very good explanation and very educational video... Keep up the great work! What would be the most efficient way to count total number of words in Trie?
I managed to do that, but I called does_word_exist at the beginning of add_word and I was incrementing the counter if it is the first appearance of the word, but that method slows down algorithm a lot... Thanks in advance!
What up cousin
Really helpful video. Can you explain why you used self.root = {"*":"*"}? I wasn't able to find much information on using an asterisk inside a dictionary. Thank you!
What is the difference between 1st implementation method and the 2nd one ?
Can anyone help me with it ?
When do you use trie and when do use trieNode
thanks a lot for this video
great..one doubt is, since we have only child node, how to handles multiple childs
you would use an array/hashmap/dictionary to collect the children, then if you want to access any given child you would use the child itself as the index for the array. e.g. for child 'a' you could do something like array[asciivalue('a')] which would then access the a node. so it's effectively self indexing as long as the array can contain all expected values from a to z
Thank you so much
I have a doubt -Won't "wait*" return True according to your first code
Probably if you project your code better in screen, you could had got more views .Anyway nice explanation
Ayy