Trie data structure - Inside code

[@insidecode]

Fix: In the third implementation, I forgot to add the attribute ch that holds the node's character

[@truejohnsolo]

tries are one of the main data structures I hadn't really studied and and for some reason I thought they were way more complicated than that. But you explained it well. I mean, it seems they're actually pretty easy to understand!

[@kirillzlobin7135]

Very good quality of the presentation. Thank you very much for your job

[@DevendraSingh-oq2re]

I am c++ user. But You explained it so clearly even python code make a whole lot of sense now. Great Man Keep uploading content.

[@abhinavmeda5042]

I think tries are nicely implemented with dictionaries

[@eldoradoarts563]

u are just crazy bro . how do you animate these kind of videos which application you use .

[@insidecode]

I work with PowerPoint

[@haidaribo6243]

Amazing explanation, but in the get_strings() method you typed: return words... I think you meant strings, right?

[@insidecode]

yes yes small mistake

[@mybuddy11]

you are number one in the world of us, i really the way which you using illustrating images, thank you very much, i hope you will make a course about graph algorithm and advanced data structure on udemy

[@insidecode]

Thanks a lot for your comment!

[@neelakshisoni6118]

@congminh7835 have u taken his course on udemy

[@aryanpandey2879]

Where is the next video?

[@true_khrisna]

Like the animation explanation. Did you use manim to make this animation?

[@insidecode]

Thanks! No I used PowerPoint

[@AyuJessieM]

What a great explanation! thank you very much. I would like to ask a question, there's a code that I still not understand in the "Insert" Part (minute 6:07) , which is : node = node.children[ch] I thought [ch] is an Index, which might suppose to be a number. but I also thought that the value of variable "ch" is a single character of each string we have, for example : string = "apple" then the value of ch is : ch = ["a", "p", "p", "l", "e"] so if we use ch for index, it would be : node = node.children[p] and perhaps the index supposed to be : node = node.children[2] My assumption might be wrong, would you mind explaining it to me Thank you very much :)

[@insidecode]

node.children is not an array, it's a hash table. And keys in a hash table can be something other than an integer, a character for example

[@AyuJessieM]

@@insidecode Alright, Thank you very much for your answer :)

[@rsKayiira]

excellent presentation thank you

[@pokortec9773]

Thanks for sharing this.

[@insidecode]

You're welcome!

[@Md_sadiq_Md]

Seing it on Ramadan Eid Mubarak ✨

[@someoneunknown2720]

Loved the explanation and got a good grasp in this data structure. Thanks 😊😊. I regularly watch your videos and they are awesome. I am stuck in binary tree probelm . Leetcode problem 654 . Maximum binary tree . Can you help me solve that problem or can you make your next video in that . Please . 🥺 Thanks 🥰🥰😍

[@kmishy]

I also want to do this level of animation. Can you please share how do you do?

[@insidecode]

For my case I use PowerPoint, so you should be comfortable with it

[@kmishy]

@@insidecode you are doing hard work ❤️

[@dahomosapien]

Does anyone know how to do this same delete code but in C?

[@goldfishdoc1999]

Wow!! Thank you

[@insidecode]

You're welcome!

[@subee128]

Thanks

[@iezioaudi22]

Thanks!!

[@TheDarkOne629]

Hi. Maybe I'm wrong, but shouldn't the 3rd implementation have a List[Tuple[str, Trie]] as children? Thanks for the video. It explained everything my professor couldn't. :)

[@insidecode]

No but I forgot the attribute ch in the class definition so yes something is missing, thanks for telling me And yore welcome for the video