8.1 Trie Data Structure | Complete Introduction | Tries | All Operations with Examples

[@erichanson8753]

Great video sir! You made it so easy to understand because you showed WHY is it important to learn which made me much more interested in learning tries. Please keep making videos, and keep up the great work!

[@uzairjavedakhtar3718]

Glad it was helpful!😊

[@mystic3549]

This is the most underrated channel i ve come across for Advanced DS....these lectures are pure gems...literally among the best ones...

[@uzairjavedakhtar3718]

Your these beautiful words of admiration means a lot🖤🖤🖤
Please share the channel with your friends and classmates if you find it helpful😊

[@39_ganesh_ghodke98]

Great Explanation 👍

[@JohnCiprian]

You’re a good teacher. Thanks for the video!

[@uzairjavedakhtar3718]

Thanks😊

[@praveenraj8704]

The saviour 🛐

[@uzairjavedakhtar3718]

❤️

[@SaurabhSrivastava86]

You have a great knack of explaining complex concepts. Great content !

[@uzairjavedakhtar3718]

Thanks A Lot Saurabh for your kind words🖤🖤🖤
Kindly share the channel with your friends😉

[@priyansupp]

Sir, if possible please make videos on string matching algorithms. Thanks in advance

[@uzairjavedakhtar3718]

Will surely try as and when I get time.🙂

[@subee128]

Thanks

[@abdelmalek9004]

Great explaining, i have a question about the trieNode struct, most of the ressources that i have seen make two fields which are (struct TrieNode * child[26] and int endsofword) instead of 3 fields like you have explained, so what's the right implementation, please ?

[@nikoufarsiu4833]

good explanations, thanks

[@uzairjavedakhtar3718]

Thanks 😊
Please share the channel🖤 if you found it helpful

[@gopalagrawal8378]

pls complete this playlist sir asap it is really hepfull,next month we hv exams

[@uzairjavedakhtar3718]

In my opinion, I have covered all the topics in the syllabus of this playlist discussed in the intro video

[@gopalagrawal8378]

@@uzairjavedakhtar3718
UNIT- P/NP: P and NP classes. Polynomial time verification. Reducibility. Some example reductions. Approximate
algorithms: vertex-cover, TSP, set covering (overview only). With Complexity Analysis.
UNIT - Special Topics
Longest Common substring, Longest common subsequences, Multithreaded Algorithms - Basics:
Computations DAG‘s, performance measures, scheduling, analysis. matrix multiplication, merge sort.Stencil
based computations.
pls try to cover these topics also sir..

[@gopalagrawal8378]

but thanks alot

[@lightyagami4856]

Sir you are doing great! please make videos on string matching as well

[@uzairjavedakhtar3718]

Thanks A Lot! Currently my exams are also going on😁 Will make after that

[@oniichanflamingdragon]

Good work!

[@palakurthisoujanya4908]

Good explanation sir tq

[@uzairjavedakhtar3718]

You're most welcome☺️

[@BALAJIS-h7i]

Is trie and Standard trie both are same ? If not what is the difference ?

[@sabhiafatima-zc8bm]

Trie is also a called standard trie?

[@uzairjavedakhtar3718]

Yes

[@ankitaakodiya6074]

🔥🔥🔥