Lecture 62: Binary Trees & its Representation || Different types of Traversals

[@shobhitshrivastav9775]

Suru majboori(placements) mein kiya tha ..pr ab mzaa aa rha hai💯💯💯💯💯💯💯💯💯💯💯💯🌟

[@krishanapoorv7710]

Agree😅

[@beingproductive22]

bhai placement lag gyi??

[@kuldeepthakur9968]

@@beingproductive22 🤣

[@rajmax0909]

we can relate to root and simply remember order by traversal name- preOrderTraversal = root, left, right inOrderTraversal = left, root, right postOrderTraversal = left, right, root

[@MukeshKumar-fz3sw]

sahi hain bro

[@manpatel9157]

Thanks bhai🙏

[@goodjob8652]

thanks bhai

[@siriam2137]

The level of quality and consistency this channel provides would drive and encourage students to sit back and study hard.. Hats off for your dedication!!✨

[@saksham1861]

Any Idea by what time will this course end?

[@John12685]

@@saksham1861 Bhai Jo parha rhy hain utna sb kr liya tmne??

[@saksham1861]

@@John12685 Nhi bro, I was just asking so that I can match my time with the course.

[@John12685]

@@saksham1861 Yr don't think much.. Jo chal rha hai jtna parhaya ja rha bs usy practice kro achy se. End honay ki fikr Ni kro... Start hua ha to compete b hojayge... Ab to honay wala hai wese

[@peterpace3379]

@@saksham1861 Don't wait for the destination Just embrace the grind and enjoy the journey.

[@Hrithik-k9m]

In order means IN / between so N is in between so L N R, Pre Order means pre/before so N is at the start so N L R, Post Order means post/After so N is at the end L R N, & Left is always left to the right It Might help

[@samiijaz128]

Bro ❤❤

[@samiijaz128]

Bro ❤❤

[@priyanshisharma5115]

bhaiya puri video dekhi hai and sth sth coding bhi kari hai and samjh full 100% aagya thanks for explaining this concept so easily

[@LuciferMorningstar-b6o]

bhai clg me 3 lectures liye sir ne sirf in-order, pre-order or post-order ke kuch samaj nahi aya, yaha 10 minutes me sab samaj aa gaya, thank you so much love babbar bhai maja hi aa gaya

[@avishkarpatil5871]

22:40 - Without using separator as NULL void display(node* root){ // without using NULL for newLine printing queue q; q.push(root); while(!q.empty()){ int n = q.size(); for(int i = 0; i < n; i++){ node* temp = q.front(); q.pop(); cout data left) q.push(temp->left); if(temp->right) q.push(temp->right); } cout

[@SahilMathur-z1w]

did u think of this yourself? im not able to create my own solutions ..pleasehelp

[@ajazahmed5079]

Bhai kya quality hai, maza aa jata h lecture dekhh kar, proper optimized approaches. Tree and graph is much needed, i hope u will keep giving quality videos bhai.

[@JatinKumar-w7f]

well I did reverse level order triversal of binary tree but I had to use queue and stack both to solve them ☺☺☺☺☺☺ and I did it's code by my self. and with the help you sir, you are so great sir

[@mondaymon3084]

subah ke 4 bjj gye hai and babbar bhaiya ke top notch content ko bina dekhe sone ka mnn nhi kr rha.... Hrr din maza aa rha hai... Thanks a ton !! :)

[@PriyankaSingh-ni8bf]

Completed the 1st half. I'm now very confident. Pehle bahot darr lagta tha DSA ke naam se lekin ab moderate si chiz lagti hai. Thank you bhaiya ye course free me dene ke liye.

[@golubhattuk01]

simple trick print the node in NLR ->first time your reach at any node --> preTraversal LNR -> second time your reach at any node -> inTraversal LRN -> third time your reach at any node ->postTraversal

[@shraddhagulati3081]

We can't get such a level of quality in paid courses like we are enjoying in this playlist

[@tayyabtararhafizabad]

Greetings Babbar, Hope you are doing well. Firstly I am thankful to you for your outstanding playlist on DSA. Dear, our exams are coming soon and we whole class are looking towards you to watch your implementation lecture on the red black tree. Please, if possible make a detailed lecture on this topic. We shall be grateful to you. Kind regards, Students of UCP-Lahore, Pakistan

[@gauravrajiitbbs]

Love from India

[@venkateshpk7822]

i have started dsa from past 3 months you're explanation and quality is upto the mark till now

[@AmanKumar-ec6bz]

Congratulations bhaiya for 3 months completed continuously video uploaded and very useful content provided us . thanku Thanku so much ❤️

[@harsh55]

bhai trust me aapne mera tree ka fear ek bar me gayab kar dia , I was always scared and confused with trees. Thank you so much ! yah tak a gaya hu puri series khatam karke rahenge

[@ManmohanBhardwaj-ft2hu]

hai bhai maine pura lecture complete kiya hai aur effort dono side se ho rahi hai 🧡🧡

[@ItsMe-iz2kb]

Kesi bat kr rhe ho bhaiya q nhi dekhege puri video.. The level and quality of content is too good no one can leave the course in the middle.. Thank you bhaiya for provided such a quality of video and full course . Thank you❤❤

[@CodeChakra]

sir aapse padhke ke sare concept clear ho jate hai aap bahot aacha padhte ho 😃 😃😃

[@sunny-gb6xh]

Thank you bhaiya for grt consistency and content. Agar ap itni mehnt se video banate ho to hum bhi puri video dekhte hai bhaiya.

[@063harshsahu2]

we can further optimise the count the leave node code if (root == nullptr) { return 0; } if (root->left == nullptr && root->right == nullptr) { return 1; } int leftLeaves = countLeaves(root->left); int rightLeaves = countLeaves(root->right); return leftLeaves + rightLeaves;

[@vaibhavsaini1234]

Bhaiya! Excellent job! Jo yeh LRN, LNR, NLR se samjhaya haina! Isse toh matlab swad hi aagya! Too good bro! Thanks a lot👏👏👏👏👏👏

[@FatimaKhan-nt1cz]

My heart fills with happiness and satisfaction when I search for a topic and your video pops up.

[@Niki_0011]

College mai esse teacher mill rkhe joo pheli baar dsa padare or khud question net pe dek ke karare literally kux smj ni aya but bhaiya literally you are God for me, when i started this serious i felt like i did not complete it but ya i have completed 62 Lecture 🔥 and complete this series . Thank's Bhaiya ❤

[@ankitmeshram5398]

It is amazing how you taught the tree so easily and simply. Thank you so much, sir.

[@PriyanshGautam]

Present bhaiya! Thanks from bottom of my heart. You r really doing so hardwork for us. God bless u.❤❤

[@anand-shankar-dev]

Yrrrr bhaiya ye kbse smjh nhi aa rha trha aapse 1st attempt me smjh gye ... Hats Off to you. thank you bhaiya🥺🥺❤❤

[@ishanpandey5917]

what is feel is ki dry run after writing the code is the USP of babbar sir because that dry run makes the code and the logic super clear

[@hitesharora4883]

bro yha tak sari video dekhi hai don't get dishearten you are doing an amazing job. maazza a rha hai bhai Keep doing bro

[@zimstuds7430]

54:50 ye sunke dil jeet liye aapne

[@jayantthakur8528]

watching videos till end with consistency bhaiya hard questions se dar lgta tha, ab to kuch nhi hai

[@prabhatmishra5667]

Reverse Level Order Traversal vector reverseLevelOrder(Node *root) { queue q; q.push(root); vector ans; while(!q.empty()) { Node *temp = q.front(); q.pop(); ans.push_back(temp->data); if(temp->right) q.push(temp->right); if(temp->left) q.push(temp->left); } reverse(ans.begin(),ans.end()); return ans; }

[@tusharvaish8096]

How print enter , and how to do without using vector ?

[@bookssky]

​@@tusharvaish8096use stack

[@j4hnvi]

@@tusharvaish8096 pop elements from queue and put in a stack you'll get reverse

[@arsh8212]

@@tusharvaish8096 umm you can use array but requires declaration of size and initialization as an argument to the function rest is simple logic vector reverseBFS(Node *root) { queue q; vector ans; q.push(root); q.push(NULL); while(!q.empty()) { Node *temp = q.front(); q.pop(); ans.push_back(temp); if(temp == NULL) { if(!q.empty()) { q.push(NULL); } } else { if(temp -> left) { q.push(temp -> left); } if(temp -> right) { q.push(temp -> right); } } } return ans; } and in the main body : vector ans; ans = reverseBFS(root); for(int i = ans.size() - 1; i >= 0; i--) { if(ans[i] == NULL) { cout

[@tusharvaish8096]

@@arsh8212 dude its have been an year and I'm now much better in dsa

[@anuradha3868]

I didn't get level order traversal 😅😅 but could able to solve in , pre and post order traversal by my own without watching the code thankyou so much babbar bhaiya ❤️🙏

[@B_S_enterainer_2025]

bhiya aap se jab se padhne laga hu na ek alag si attachment ho gyi hai aapase ab to asa laga hi agar apko na dekhu to kaise din dalea great work bahiya i i placed my dream company i wish to meet to you

[@avibirla9863]

Bhaiya achha hua BFS ka dry run karaya tab jaake Pura samjha k kya ho raha h queue m ..varna kuch bhi nhi samj raha tha .....DRY RUN IS IMPORTANT !!!!

[@aishwaryaporwal2321]

Bhaiya kaamal dhamal krdia aapne toh best ho bhaiya aap💯💯♥️ plss bhaiya Trees pai bht questions krwana yah thoda difficult lgta h😬

[@hashcodez757]

bhaiya mza aagya!! itna basic aur mjedaar tareekey se kisi ne nhi padhaya

[@naveensingh_0735]

Tree tak aa gye!!! We've come a long way!!! Thank you bhaiya

[@AnuMessi10]

Tree and graph, the two data structures which separates the peasants and the royals 🔥

[@CodeHelp]

Reminds me of 9th Class SST

[@mancunianswagger3668]

What a quote👌

[@ManishMandal-k6p]

Amazing lecture of tree i know understand every thing in this lecture

[@the_haryannvi_coder]

38:00 nhi bhai aa gya h samaj, aapne itne ache se jo btaya h ❤❤❤❤

[@raghavmanish24]

i'm learning tree first time and it's i get all of content of this video.....thanku bhaiya

[@tirthrajmahajan3234]

My Implementation of Reverse Level Order Traversal Order Traversal Thought Proceess: While printing level order traversal, we used to print the front of queue directly if it existed. So if we store the front of queue into a stack, then later we can print the order in reverse. Without the pyramid style printing: void reverseLevelOrderTraversal(Node* root){ coutleft); } while(!st.empty()){ cout

[@mayurgupta1110]

leaving this channel bhaii nee huggg diyaa level order traversal me

[@anshrai6]

shi me chutia banaraha ha ye

[@watashibaby8036]

Video k last mein apke words sun k muje aur motivation milli hai... Thanks for you quality content ❤️

[@prateeksharma3680]

attendance marked 👍👍👍 consistency next level 🔥🔥🔥

[@shubhammathur027]

Following this channel from very 1st video but this video can not justify the level of content he is sharing with us yes this video is not at that level but still love for babbar bhaiyaa❤😊

[@ashvinbari9687]

Me pura last tak dekhta,Thanks sir

[@RohitPatel-cq3vg]

I am completed this video's Awesome video I like and brief introduction so much useful for understanding concepts

[@prakharsingh1203]

🤩🤩🤩😍😍😍😍😍😍Bhaut Achese samjh aayaaa Tree kaa concept Thankyou bhaiya

[@Devkumar-en7zu]

code likhne se acha dry run karwa kar padhaya kare sir bcz that is better for clearance of the topic

[@songlyrix]

bhai isi trha samjhate rahu hum pori Koshish krte hain samajhne ki lekin constructor nhi samajh aya. apki videos usi time samajh aye gi jab pichli videos dekhe ge lekin itna time nhi hota k ik topic samajhne k liye baki videos dekhen

[@prashantbirajdar9271]

mast bhaiyaa ekdum maza a rha hai muze ....ekdum samaj aa rha hai subkuch badhiya tarike se...nicee..love u bhaiyaa

[@anuketkumar]

mind blowing content bhiya, pura implementation smjh gya.

[@mukulmishra24]

Queue ki video dekhte dekhte binary tree ki video aagai....next level efforts🔥

[@omgupta5477]

The level of quality and consistency this channel provides would drive and encourage students to sit back and study hard.. Hats off for your dedication!!✨, placement phodenge

[@satyamkumarrai6112]

BHAIYA CAN YOU PLEASE MAKE A PLAYLIST FOR APTITUDE Questions for Incampus and Offcampus Placement

[@VK_BRANDING]

Advance congratulations for 500k subscriber's @Codehelp🎉🎉🎉❤❤

[@aryan5035]

Consistency OP. Your consistency motivates to be consistent.👏

[@ayushp4471]

Thank you bhaiya for your efforts 54:54 Happy to be in 1% 😌✨

[@arv8547]

bhaiya mujhe bohot dukh h ki mujhe aapka channel first sem ke baad second sem me mila.Ek sem me aapke video se jitna sikhta utna productive dusra koi channel.....famous ones.....koi nahi laga

[@Samtoosoon]

Node*build tree(node *root) { cout right= Return root;

[@Samtoosoon]

node(int d) { this--data=d; this left = null; }

[@rachitmittal448]

HW: Reverse Level Order Traversal Use Stack along with Queue void ReverseLevelOrderTraversal(Node* root){ queue Q; stack S; S.push(NULL); Q.push(root); Q.push(NULL); Node* temp; while(!Q.empty()){ temp = Q.front(); Q.pop(); if(temp){ S.push(temp); if(temp->right){ Q.push(temp->right); } if(temp->left){ Q.push(temp->left); } }else{ S.push(NULL); if(!Q.empty()){ Q.push(NULL); } } } S.pop(); while(!S.empty()){ temp = S.top(); S.pop(); if(temp){ cout data

[@soumyadipsamanta3771]

I dont know vaiya what motivates you to do this series one after other video consistently with complete and full information in such a detailed way. I just can only say that I have net seen any other placement series in so detailed and easy to understand way in youtube. Even I was thinking that, is there anything which can be added or change about the way you are teaching so that I can mention about that in comment but really simply nothing came to mind. This placement series is way too perfect vaiya❤️❤️

[@HARRY-xz1hf]

Money

[@jitendrasharma2388]

kya fadu course bna rhe ho bhaiya bole to jhkas

[@shivanshisharma3718]

Bhaiya mai peeche rahegi but mai sb cover kr lungi Thankeww so much bhaiya 👍

[@navdeepladdha1775]

Completed binary tree first lecture mja aagya 🙏👍🫡

[@rookie2048]

bhailog like and comment na bhulo he is working hard and creating this for free. He could have chosen to sell it for some amount but he did it for free. Its not like he is not doing it for himself and jut doing it for us, ofc he earns money from this but We should be thankfull that we have this playlist ready for us.

[@prachigupta4605]

Best explained with run, I am taking live class of Fraz It is terrible

[@asdsd-wu4yw]

G.O.A.T of patience and teaching 🤩🤩🤩🤩🤩

[@jatingarg1897]

Badhiya Bhai! Mza aa raaha hai sachme bahut! Thanks to you.

[@karanborana8540]

Just finished the video! Totally loved it ! 🙌😍 Your consistency and dedication is on next level...🙌👌

[@KPCoder]

Thanks you sir, excellent content, no one can explain like you from basic 🙏 god bless you

[@ManmohanBhardwaj-ft2hu]

Ha bahi concept clear hai 👍👍 bas revision ke time ke concept recall karne mai thoda time lagta h

[@shubhamaswal1068]

3:36 AM pe shoot khatam lots of love bhaiya you encourages us so we give our level best

[@tanyagupta7067]

thankyoufor providing this video and playlist, has helped me to quickly understand evrything.

[@arpit7618]

your efforts are just high level

[@shashankgaur3917]

If you know that time was "3:36" you are doing good to yourself 🙂

[@SachinGoswami-d7i]

code for Reverse order traversal void reverse(Node* root) { queue q;' q.push(root); stack s; while(!q.empty()) { Node* temp = q.front(); q.pop(); s.push(temp); if(temp->right != NULL){ q.push(temp->right); } if(temp->left != NULL){ q.push(temp->left); } } }

[@ArnavShukla]

16:23 pe hi apne ap tree banna kaise roka program mai? kuch code mai define to kiya nai h stoppage point ki is point ke baad rukwana hai tree banana

[@SHREYAPANDEY-vo8dm]

I continously watching ur playlist and really it's amazing ... Hat's off bhaiya

[@focus.placement5589]

ekdum crystal clear bhaiyaaaa... thanksyouuuuu

[@sadaf_r]

Little bit confused now but I believe aap clear kardo ge😅

[@FunWithSports121]

LOVE YOU SIR GREAT QUALITY CONTENT 🥳

[@DeepanshMaurya-w7i]

void countleaf(Node* temp , int &count) { if(temp == NULL) return; countleaf(temp -> left, count); countleaf(temp -> right, count); if(temp -> left == NULL && temp -> right == NULL) count++; return; } int countLeaves(Node* root) { Node* temp = root; int count = 0; countleaf(temp, count); return count; } COUNTLEAF

[@yashchauhan7221]

Ab Maja Ayga Tree And Babbar Bhaiya OP🔥

[@hrithikshaw4812]

bhaiya queue ke thode aur question krwa diijiye hard wale jaise stacks ka krwaye the

[@Ykj21]

You are doing very good work bhaiya. Keep it up . ❤❤❤

[@vishalgarna4580]

Saj aa gaya sirrr🎉🎉😊

[@shrutijaiswal871]

💯 Bhaiya two videos per day !

[@prayagpatel9136]

3.36am.......thats the dedication level i want to achieve.......hats off

[@anuragraut5101]

glad to be among the ones who watches till the very end

[@rishabhpandey4517]

54:55 dekha bhaiya yahan tak thanks for awesome content aur itna detail me cover karne ke liye manna kaam bachhe dekhte hain but yeh course aisa hai ki bas ki student ko bol sakte hai "youtube pe CODEHELP by Babbar " search karo saab hojaye C++ language se placement Tak Thank you So much

[@R_S_R_389]

Bhiya trees ke Upr Bhut sare questions krwa Dena😀...Jisse Koi Dikkat Na AAy Bad me..

[@unboxtheuniverse5336]

Bhaiya plz make a *Roadmap Series for crack internship in 5 month with DSA busted course as resource* 🤩 { 5 months left } ~ plz reply

[@adarshpandey345]

Lot's of love towards students thanks you sir

[@ritikraj2629]

consistency op bhaiya🌟🌟

[@rachit_joshi]

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

[@shivamjha6580]

Great video bhaiya 🔥🔥🔥🔥