Lecture 79: Trie & its Implementation || C++ Placement Series

[@solarchat9413]

You said you will complete for sure, and here you are. Thanks 👍

[@shraddhasingh8574]

learning from this series since 3 months, really helpful to me . thank you for your hard work you're doing a really good job

[@aryanmaniyar7301]

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 :)

[@amarparajuli692]

Waaahhh..... Iss series se koii v Noob apni programming skills ko behtaar bana saktaa hai.🔥🔥

[@manavsharma142]

Hats off to your hardwork and dedication bhaiya ....Please never change yourself , you are a great person

[@anushkayachit]

Finalllyyyyy... Aagaye aap.... Don't worry we are here only.... We know you'll complete this series 🔥🔥

[@bollywoodmaestro4553]

koi idea h aur kitne time chalega ye series

[@sandeep_khariwal8137]

@@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"😑

[@MukeshKumar-fz3sw]

Why here created two different-different class trienode and trei pls help

[@devesharya5184]

@@MukeshKumar-fz3sw because, tree is the set of all nodes created, so we make tree node by node.

[@AyurvedaAddict]

The Most Ever Easy Explanation of Trie... My first video on Trie and understood it fully.. in one time ✅✅

[@AshishSharma-ly9lg]

Your window which turned from daylight to dark in a single video motivated me to work with consistency no matter what!!

[@tmhd48_abhishekbade78]

Brother, Your teaching method is ingenious I am big fan. RUN machine = VIRAT KOHLI (Sir) CODE machine = BABBAR (Sir)

[@human75788]

One word : Love Babbar❤ Sir, just outstanding.

[@anshikasingh4158]

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

[@aparnamanna1369]

Finally 😎 bhaiya is back , Bhaiya placement series discontinue mat karna I'm literally enjoying your series

[@RiteshYadav-lh4wo]

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.

[@govindsuryavanshi6653]

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.

[@mdshahariarsadiq9995]

can you give me the trie implementation code..

[@sukhjitsingh959]

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 ... 👍

[@itsaayush7357]

To edit karke theek kr le na😂

[@therealartist9]

@@sukhjitsingh959 bhai nxt level hai tu nayi bna diya teacher ko😆

[@sukhjitsingh959]

@@therealartist9 bahi toon tu mere se bhi next level hai ...abhi professionals wali baat nahi tujh mein ....

[@therealartist9]

@@sukhjitsingh959 mcc tune professional bankar kya kar liye ?? corporate ke majdoor

[@sukhjitsingh959]

@@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

[@RohitKumar-oo8lo]

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 !! ♥♥

[@bollywoodmaestro4553]

av aur kitne din lagenge is series ko khatam hone me ?

[@Engineer_With_A_Life]

Bhai placement hogya tumhara? Khaan hua?

[@RaviRana-d2w]

I have implemented by myself just by listening till 11:13. Thank you Babbar Bhaiya 😃

[@shobhitmaste]

cap

[@sandipmedhe1201]

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

[@virendrakeshri6072]

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

[@_KARAN-699]

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; } }

[@anuptewary3016]

Bhaiya tension na lo we all are with you ❤️🔥

[@Satya-g5t]

Patiently and well explained every problem.

[@aakashbhargavaa]

Thanks for continuing this course. Thank you so much.

[@MukeshKumar-fz3sw]

Why here created two different-different class trienode and trei pls help

[@HARRY-xz1hf]

@@MukeshKumar-fz3sw did you get the answer

[@UEEANILKUMAR]

Thank you so much for coming 🙏🙏🙏. We fully trust on you .

[@awesomepatt620]

Awesome content bhaiya..waiting for your LIVE course very anxiuosly

[@itsaayush7357]

At last me when bhaiya said.. "Pr vo bhoola nahi he".. Sounds like a movie dialogue 🔥

[@ShridharSarda]

Thanks for this course Bhaiya ,consistency++

[@dewanshyadav6033]

full trust on you bhaiya ♥️👍👍👍

[@VivekSharma-lr7kx]

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);

[@Mkhuss]

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

[@human75788]

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.

[@supersuperhero2449]

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

[@utkarshsingh1457]

Thanks for the beautiful content Bhaiya ❤️❤️

[@parthtrivedi318]

Thank you bhaiya hamare liye itne efforts karneke liye

[@sharatpaul]

If we consider uppercase and lowercase then there should be 26*2=52 possible paths from a node

[@fnGamingz]

no, better to convert the input to lowercase always.

[@lakshitgoel8481]

​@@fnGamingzbut in that case, you will lost the original input from the user, which is not a good practice

[@prashantbirajdar9271]

maza aaa gyaa sir swad+++ subkuch samaj aya achhe see..... love you sirr and consisitancy+++

[@sushilsahu5719]

Thanks you bhaiya for quality content 🤗♥️

[@excelexpertclasses6776]

learned much from this video babbar ji thank you

[@parasmanku7536]

What is the refresh rate of this monitor ?

[@niharbastia5740]

Full support bhaiya❤️💙... Keep up the consistency 💥⚔️

[@MukeshKumar-fz3sw]

Why here created two different-different class trienode and trei pls help

[@skchoudhary4122]

Trie color🔥🔥

[@gatikalagh39]

good teaching skills

[@Lucifer_movies]

We have full trust on you bhaiya ♥️

[@sounaksaha1455]

space optimization in trie is OP. 🔥🔥🔥

[@sumitkanth5349]

how space can we optimized in remove function ?

[@rishisharma3867]

@@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

[@Vije860]

Finally new video comes 😁😁 Welcome back bhaiya 🙏🙏

[@saritaprasad4295]

Great explanation! I am here to strong DSA

[@inspiringzone12]

Thank you so much for coming back bhaiya

[@krishan9739]

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.

[@rajshrivastava906]

Thank you so much bhaiya for continuing this series.

[@mkat21]

Bhaiya OP.bas ese hi maan kar rha tha bolne ka toh bol dia.😂

[@aashishrangdal9614]

Bhaiyya consistency dikhao zara😅😅 Plz daily videos dalne ki koshish kro⚡⚡🔥🔥

[@shailenkaushik4910]

Awesome explanation,Sawad++😅😅

[@rachit_joshi]

Thank You So Much BHRATA SHREE !!!!!!!

[@justjellytechnology3462]

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

[@chayanmallick939]

Just start from the bottom and check if it has any child nodes then dont delete it if not then delete that node.

[@justjellytechnology3462]

@@chayanmallick939 Tnx..

[@raisanjeeb42]

Nice Explanation bhaiya..Crystal Clear🔥🔥

[@b-237-abhishekmishra7]

Thank you bhaiya very helpful video ❤️

[@KratosProton]

Aap hi ka intezaar thaa....

[@adityavishwakarrma514]

Yo yo video a gyi😀😀

[@arpitrajput6424]

Finally Achhe din Phir aa Gaye😎😎 Present++

[@mukeshkir1991]

sir ji ...greedy algorithm bhi karayoge na .....🧡🧡😥😥...please reply ...lots of love from mount-abu

[@MeetaCollection]

but sir agar koi do ka prefix search karega aur do removed hoga toh us case mein prefix search toh true return karega

[@mkp189]

How dud your lower case input give matching?? Index was calculated based on upper case so overflow hona chahiye tha since children only 26

[@ShubhamKumar-rh3dz]

shi bol rha bhai..mere me fss gya tha.. fir maine index ke liye lower case use kiya

[@rishabhupadhyay8165]

Thnx

[@sumitkanth5349]

how space can we optimized in remove function ?

[@KratosProton]

Great explaination

[@ayushgoel4145]

Dhanywaad Bhaiya!

[@RohitKumar-oo8lo]

Abhi mazza aayga na Bidu!! :D

[@Undertaker1122]

🙌🙌🙌dil se respect

[@bhavyasharma3500]

Thanks Babbar Bhai !!

[@anandprateekbaranwal8275]

Awesome going bhaiya 💥

[@eprithvikushwah4754]

hmesha maza aata h love bhaiya

[@dipakkumarsingh.7151]

maja aagaya....

[@jaydwarkadhish959]

Sir amazing video

[@Harish50602]

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 ?

[@venkateshpk7822]

nice explanation bhaiya

[@letsgo8640]

Wonderful!

[@memorybyshubhammanitripath4368]

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 🙏🙏🙏🙏

[@mohammedkaif5358]

this lectures code is not uploaded in github,is it uploaded somewhere else?

[@AmandeepSingh-cs3we]

Won't the time complexity be O(length^2) cuz we are doing substr, which also takes O(length)?

[@fazerugbrug439]

superb

[@pratik_code]

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

[@sanskarkumar028]

thanks love bhaiya

[@rajkumarojha1028]

Maza agaya bhaiya ❤️

[@kumarpawansahh]

Welcome bhaiya

[@JohnSmith-uu5gp]

Just Awesome

[@TechUprise-by-Jyoti]

Thank you bhaiya😄

[@vedantdeshmukh4949]

Babbar sher is back!

[@akashjha822]

East or west Babbar Bhaiya Is The Best

[@mr.himanshu4299]

keep uploading babbar bhai

[@divyadixit5607]

Bhaiya apne wo 26 character ka mapping konse video me samjhaya hai ??

[@divyanshupant3892]

swaad agayaaaaa

[@BornHubisLive]

Thanks a lot bhaiya....

[@adityaprasad2298]

solution for removal of word: void removeUtil(trienode* root,string word){ if(word.length()==0){ root->isTerminal=false; cout

[@shiwangkashyap8887]

Bhaiya op msttt

[@sane_aalam]

Present Bhaiya ❤️⌚

[@itzheavem4451]

great video 👍

[@CodeAndThrive]

Kipp it up bhaiya....🔥🔥🔥

[@AAnand-my1ql]

Thank you Bhaiya

[@akankshapandey9773]

Thanku sir 🙏

[@moharramansari3343]

Finalllyyyyy!! Free ka trie.

[@sounaksaha1455]

Bhaiya back in business, please aab chorke na jaiyo.