Bhaiya, itna quality content free mein provide karna is not a joke! Bilkul samajh sakte hai ki aapko bhi aapke personal kaam hote hai, so thank you so much for taking your time out for this :)
@@bollywoodmaestro4553 jo abhi flow chl rha h series ka... according to that 2months lg jayenge...agr bhaiya dubara flow me aa jate h to ye series within 1month me ho jayegi...jo ki ab flow me aana mushkil h 😭...."Look on us bro we are dependent on you"😑
First I have completed all DSA series and now conclude this is Greatest ever DSA series to exists on youtube or paid courses. Your contribution will be remembered. You're God of DSA for us🙇♂ Thanks you.
Babar I can understand you and trust you ....there is no any need to think even about your commitment in suspicious way .... 👍 So I trust your thoughts so thanks for you such course and thoughts .......you have ... 👍
@@therealartist9 Teri ukaad ka frakh dikhta hai ... Putraa ethey Tera Bappu bethaa pange nahi laydee ... Text tu pattaa lagda Teri ukaad da .... Kar te mein bahut kuch laya... ... Tere Paley nahi panee
00:00 Implementing a dictionary with three operations: insertion, search, and removal. 02:22 Trie data structure implementation in C++ 07:47 Implementation of Trie data structure in C++ 10:50 Understanding the structure of the trie data structure. 16:48 Introduction to Trie data structure 19:50 Understanding the implementation of Trie 25:11 Trie node types 28:45 Trie data structure and its implementation in C++ 33:43 Removing words from a trie and optimizing space. 35:50 Trie is a data structure used for efficient space utilization and optimal utilization. 40:36 Implementation of Trie data structure in C++ 43:08 Understanding the implementation of Trie data structure Crafted by Merlin AI.
calling the function length of word times but for each calling you are passing the string hence the for every call there is creating a string of size(n-1) hence ' for inserting with recurstion it is O( len*len);
Just watching your explanation and class building only I myself wrote both iterative & recursive solutions of build a trie from scratch in leetcode, both were 100% correct. Your explanation is just too simple and easy to understand.
29:20 we do not need to make child in searching we can directly do this!! int index = word[0] - 'A'; if (root->children[index] != NULL) { return searchUtil(root->children[index], word.substr(1)); } else { return false; } }
In deleting, while returning do free(child) ; to free the space , make root->isterminal=false , for making nonterminal to last character of word so word doest comes in search while searching
@@sumitkanth5349 traverse to the last character node then start deleting the node in reverse order one by one until u found isTerminal = true for a node
Hashset and Trie are not explained in detailed. At least not like others. These are the most important data structure and you solved very few questions for both.
35:20 at this how we can optimise the space. Suppose we remove TIS word from trie then TIME will impact. Can you solve my problem. I can't understand this point
Bhaiya as you mentioned Trie uses less memory than hashmap by showing those 5 words ARE,ARM,ARENA,ARMDILO,ARDENO in these words if i try to search ARM will it not show false as isTerminal will be false in the node M ?
Bhaiya code section update kar do 🙏😁 By the way maja bahut aaya Bola tha na 19 April ko catchup kar lunga course So 18 April ko hi done Bahut maja aa raha bhaiya 🙏🙏🙏🙏
You said you will complete for sure, and here you are.
Thanks 👍
Bhaiya, itna quality content free mein provide karna is not a joke! Bilkul samajh sakte hai ki aapko bhi aapke personal kaam hote hai, so thank you so much for taking your time out for this :)
Hats off to your hardwork and dedication bhaiya ....Please never change yourself , you are a great person
learning from this series since 3 months, really helpful to me . thank you for your hard work you're doing a really good job
Your window which turned from daylight to dark in a single video motivated me to work with consistency no matter what!!
Waaahhh..... Iss series se koii v Noob apni programming skills ko behtaar bana saktaa hai.🔥🔥
Finalllyyyyy... Aagaye aap.... Don't worry we are here only.... We know you'll complete this series 🔥🔥
koi idea h aur kitne time chalega ye series
@@bollywoodmaestro4553 jo abhi flow chl rha h series ka... according to that 2months lg jayenge...agr bhaiya dubara flow me aa jate h to ye series within 1month me ho jayegi...jo ki ab flow me aana mushkil h 😭...."Look on us bro we are dependent on you"😑
Why here created two different-different class trienode and trei pls help
@@MukeshKumar-fz3sw because, tree is the set of all nodes created, so we make tree node by node.
The Most Ever Easy Explanation of Trie...
My first video on Trie and understood it fully.. in one time ✅✅
sir aap toh sach mein din raat mehnat karte ho. video shuru hui thi toh din tha, raat ho gyi khatam hote hote. respect++;inspiration=babbar
Brother, Your teaching method is ingenious I am big fan. RUN machine = VIRAT KOHLI (Sir) CODE machine = BABBAR (Sir)
First I have completed all DSA series and now conclude this is Greatest ever DSA series to exists on youtube or paid courses. Your contribution will be remembered. You're God of DSA for us🙇♂ Thanks you.
can you give me the trie implementation code..
Finally 😎 bhaiya is back ,
Bhaiya placement series discontinue mat karna
I'm literally enjoying your series
thanks bhaiya aap plz continue karo aap sahi me bahut acha padhate ho ye dsa ka best course ho sakta h you tube par plz bhaiya discontinue mat karna
I have implemented by myself just by listening till 11:13. Thank you Babbar Bhaiya 😃
cap
Thank you bhaiya aap vapas aa gaye hume pura bharosa hai ki aap isko pura complete kar ke rahoge because your are the love bhaiya
Bhaiya, plz 30 April tak khatam kardo, jitna jaldi khatam hoga utna zyada hum khudse aur practice kar paaynge questions..Especially graph aur DP k...Please !! ♥♥
av aur kitne din lagenge is series ko khatam hone me
?
Bhai placement hogya tumhara? Khaan hua?
One word : Love Babbar❤ Sir, just outstanding.
Thanks for continuing this course. Thank you so much.
Why here created two different-different class trienode and trei pls help
@@MukeshKumar-fz3sw did you get the answer
Babar I can understand you and trust you ....there is no any need to think even about your commitment in suspicious way .... 👍 So I trust your thoughts so thanks for you such course and thoughts .......you have ... 👍
To edit karke theek kr le na😂
@@sukhjitsingh959 bhai nxt level hai tu nayi bna diya teacher ko😆
@@therealartist9 bahi toon tu mere se bhi next level hai ...abhi professionals wali baat nahi tujh mein ....
@@sukhjitsingh959 mcc tune professional bankar kya kar liye ?? corporate ke majdoor
@@therealartist9 Teri ukaad ka frakh dikhta hai ... Putraa ethey Tera Bappu bethaa pange nahi laydee ... Text tu pattaa lagda Teri ukaad da .... Kar te mein bahut kuch laya... ... Tere Paley nahi panee
00:00 Implementing a dictionary with three operations: insertion, search, and removal.
02:22 Trie data structure implementation in C++
07:47 Implementation of Trie data structure in C++
10:50 Understanding the structure of the trie data structure.
16:48 Introduction to Trie data structure
19:50 Understanding the implementation of Trie
25:11 Trie node types
28:45 Trie data structure and its implementation in C++
33:43 Removing words from a trie and optimizing space.
35:50 Trie is a data structure used for efficient space utilization and optimal utilization.
40:36 Implementation of Trie data structure in C++
43:08 Understanding the implementation of Trie data structure
Crafted by Merlin AI.
calling the function length of word times
but for each calling you are passing the string hence the
for every call there is creating a string of size(n-1) hence '
for inserting with recurstion it is O( len*len);
Yes. To optimize this, u can add a more parameter to the function "index", and u can call the function as index+1 for next call
Patiently and well explained every problem.
Just watching your explanation and class building only I myself wrote both iterative & recursive solutions of build a trie from scratch in leetcode, both were 100% correct. Your explanation is just too simple and easy to understand.
Bhaiya tension na lo we all are with you ❤️🔥
29:20 we do not need to make child in searching we can directly do this!!
int index = word[0] - 'A';
if (root->children[index] != NULL)
{
return searchUtil(root->children[index], word.substr(1));
}
else
{
return false;
}
}
In deleting, while returning do free(child) ; to free the space
, make root->isterminal=false , for making nonterminal to last character of word so word doest comes in search while searching
If we consider uppercase and lowercase then there should be 26*2=52 possible paths from a node
no, better to convert the input to lowercase always.
@@fnGamingzbut in that case, you will lost the original input from the user, which is not a good practice
Awesome content bhaiya..waiting for your LIVE course very anxiuosly
full trust on you bhaiya ♥️👍👍👍
Thank you so much for coming 🙏🙏🙏. We fully trust on you .
At last me when bhaiya said..
"Pr vo bhoola nahi he"..
Sounds like a movie dialogue 🔥
Thanks for this course Bhaiya ,consistency++
Thank you so much bhaiya for continuing this series.
space optimization in trie is OP. 🔥🔥🔥
how space can we optimized in remove function ?
@@sumitkanth5349 traverse to the last character node then start deleting the node in reverse order one by one until u found isTerminal = true for a node
Thank you bhaiya hamare liye itne efforts karneke liye
Hashset and Trie are not explained in detailed. At least not like others. These are the most important data structure and you solved very few questions for both.
We have full trust on you bhaiya ♥️
maza aaa gyaa sir swad+++ subkuch samaj aya achhe see..... love you sirr and consisitancy+++
Bhaiya OP.bas ese hi maan kar rha tha bolne ka toh bol dia.😂
Thanks for the beautiful content Bhaiya ❤️❤️
learned much from this video babbar ji thank you
Thanks you bhaiya for quality content 🤗♥️
good teaching skills
Thank you so much for coming back bhaiya
Trie color🔥🔥
Full support bhaiya❤️💙... Keep up the consistency 💥⚔️
Why here created two different-different class trienode and trei pls help
Great explanation! I am here to strong DSA
Awesome explanation,Sawad++😅😅
Finally new video comes 😁😁
Welcome back bhaiya 🙏🙏
Finally Achhe din Phir aa Gaye😎😎 Present++
hmesha maza aata h love bhaiya
35:20 at this how we can optimise the space. Suppose we remove TIS word from trie then TIME will impact. Can you solve my problem. I can't understand this point
Just start from the bottom and check if it has any child nodes then dont delete it if not then delete that node.
@@chayanmallick939 Tnx..
Bhaiyya consistency dikhao zara😅😅
Plz daily videos dalne ki koshish kro⚡⚡🔥🔥
Yo yo video a gyi😀😀
Thank You So Much BHRATA SHREE !!!!!!!
Nice Explanation bhaiya..Crystal Clear🔥🔥
Aap hi ka intezaar thaa....
How dud your lower case input give matching?? Index was calculated based on upper case so overflow hona chahiye tha since children only 26
shi bol rha bhai..mere me fss gya tha.. fir maine index ke liye lower case use kiya
East or west Babbar Bhaiya Is The Best
sir ji ...greedy algorithm bhi karayoge na .....🧡🧡😥😥...please reply ...lots of love from mount-abu
Thank you bhaiya very helpful video ❤️
What is the refresh rate of this monitor ?
but sir agar koi do ka prefix search karega aur do removed hoga toh us case mein prefix search toh true return karega
Bhaiya as you mentioned Trie uses less memory than hashmap by showing those 5 words ARE,ARM,ARENA,ARMDILO,ARDENO in these words if i try to search ARM will it not show false as isTerminal will be false in the node M ?
swaad agayaaaaa
Great explaination
cout
solution for removal of word:
void removeUtil(trienode* root,string word){
if(word.length()==0){
root->isTerminal=false;
cout
Abhi mazza aayga na Bidu!! :D
Bhaiya code section update kar do 🙏😁
By the way maja bahut aaya
Bola tha na 19 April ko catchup kar lunga course
So 18 April ko hi done
Bahut maja aa raha bhaiya 🙏🙏🙏🙏
Thnx
Awesome going bhaiya 💥
maja aagaya....
Sir amazing video
love from 3 tier college❤❤
sir design patterns bhi padha do
I am not able to understand this in first go, but eventually get to know the concept
if you are still confused than you can contact me
@@Everydayshorts913 my search function is giving wrong output
@@Everydayshorts913 I'll be greatful to you if you can explain me.
@@simranbandhu9926 your code please
Dhanywaad Bhaiya!
Bhaiya, can you do more questions on hashmaps as you said in that last video?
Thankx bhaiya aapki awaj suune ke liye Kan taras rahe the
Won't the time complexity be O(length^2) cuz we are doing substr, which also takes O(length)?
nice explanation bhaiya
Thanks Babbar Bhai !!
keep uploading babbar bhai
Wonderful!
Babbar sher is back!
296 ✅completed 👍Liked 1:22
🙌🙌🙌dil se respect
Present Bhaiya ❤️⌚
Maza agaya bhaiya ❤️
thanks love bhaiya
Bhaiya back in business, please aab chorke na jaiyo.
why is it not word.length()==1? because we should be checking the condition isTerminal for the last character......
root points to the last node in case of word.length() == 0. But, it points to the prefix of last node in case of word.length() == 1.
present guru ji .. consistency ++ . we know you have complete this series..
Thanks a lot bhaiya....
how space can we optimized in remove function ?
superb
great video 👍
Java Code For Trie
-------------------------------------------------------------------------------------
class TrieNode{
char data;
TrieNode[] children=new TrieNode[26];
boolean isTerminal;
TrieNode(char ch) {
data=ch;
for(int i=0;i
Reach++
Attendance marked✅