Maximum Depth of Binary Tree | Height of Tree| Tree Data Structure playlist C++ | Hello World

[@hikikomori9387]

I don't know how do we even learn to think like that, the way you came up with the solution recursively, already having an intution what the final recursive call going to return and building up to the final solution. Do people who are really good at DSA just born with this talent? or does it come from practice. I don't think I'll even be able to be as good as you or any other DSA KZbinr. Some people are too good to be true. I'm really beating myself over it and getting depressed.

[@HelloWorldbyprince]

nobody born with the talent expect Karna ( in mahabharat ) and u don't need to be like me or any other KZbinr u just have to be better than yourself bass be consistent buddy u will do it

[@supriyamanna715]

woah woah woah, bhaiya has seen enough rejections and a hell lot of wrong ways of solving problems which make his explaination so easy, its same for all

[@AAYUSHSHARMAPCE21CS002]

Finally I understood this topic just because of you!!!! Thankyou sirr!!!!❤

[@akulanvn381]

Bhaiya you are the best in explaining thank you yaar. i understood everything so clear.

[@ferozekhan4021]

Bhut acha smjhaty ho bhai. Thank u 🎉

[@satyaprakashsingh952]

Guru ji pan papper wala sabse best hai isi pr continue rhiye

[@HelloWorldbyprince]

Thanks 👍 dude

[@kamalkushwaha4908]

Got more clear understanding...Thanks🙏

[@HelloWorldbyprince]

Thanks for sharing feedback

[@vitaminprotein2217]

we can do straight bfs traversal as height of the tree would be= no.of levels,but ya if height of left and right sub tree are asked the we can do like as taught vector ans; // edge case if(!root) return 0; queue q; q.push(root); while(!q.empty()) { vector temp; int size = q.size(); for(int i=0; ileft) q.push(node->left); if(node->right) q.push(node->right); temp.push_back(node->val); } ans.push_back(temp); } return ans.size(); }

[@HelloWorldbyprince]

yes bro

[@rohitsoni5491]

Great Video Brother :) my friend suggested your tree videos, truly commendable.

[@AnkitKumar-oz6wl]

Bhaiya hum root->left mei kitne node hai unko store kar lenge ek variable mei and then root ->right ko bhi store kar lenge and maximum print kar denge. Sahi approach hai bhaiya

[@HelloWorldbyprince]

yess, u can , lekin isse better ki ek baar iss approcah ko dry run kijiye and then please code karke submit kijiye and fir naya yaha comment karke mujhee v bataa dena aap

[@naitikrathore3317]

This guy is very underrated

[@tanvisharma6879]

Homework Done! Can't thank you enough bhaiya:D

[@HelloWorldbyprince]

Just spread this channel 😁

[@patilashish]

Simple and accepted solution:- func maxDepth(_ root: TreeNode) -> Int { if root == null { return 0 } if root.left == null && root.right == null { return 1 } let maxDepthLeft = maxDepth(root.left) let maxDepthRight = maxDepth(root.right) return max(maxDepthLeft, maxDepthRight) + 1 }

[@HelloWorldbyprince]

Waooo amazing

[@cr7johnChan]

Aapke graph ki series ke karn yeh khud kar paya hoon . int maxDepth(TreeNode* root) { queueq; if(root==NULL)return 0; int ans=0; TreeNode*temp; q.push(root); while(!q.empty()){ int s=q.size(); while(s!=0){ temp=q.front(); q.pop(); if(temp->left!=NULL){ q.push(temp->left); }if(temp->right!=NULL){ q.push(temp->right); } s--; }ans++; }return ans; }

[@HelloWorldbyprince]

thanks for the support buddy

[@alexmercer5870]

Arey Bhai Bhai bhai bhai! Kya mast smjhaate ho bhai❤️ Thanks for being exist🔥

[@HelloWorldbyprince]

Thanks brother you exist for listening me

[@sudhadevi6692]

I was able to solve it from different approach .. but thanks for this ❤ 📹

[@HelloWorldbyprince]

Most welcome 😊

[@pranithreddy]

Bhaiya nice explanation

[@HelloWorldbyprince]

Thanks a lot

[@itsaayush7357]

Bhaiya please AAP recursion tree se he recursion ka code btaya karo...usme concept ek dum badiya clear hota he...ese m dande bnakr thoda ajeeb sa lagta h

[@maneeshapanu]

sir you explained really well thank you so much. Great explanation.

[@HelloWorldbyprince]

You are most welcome

[@AbhishekKumar-de3eo]

Question ko solve krne lga.. Total No. Of node se, leftmost,rightmost se 40 mins nikal gye.. most test fass rhe the After that, I view this full vedio... I was Like, Ekdum inhone wqt bdl diya, jazzbat bdl diye, zindgi bdl di...eh mazak ho rha hai 🥲

[@HelloWorldbyprince]

Waooo thanks Abhishek keep learning

[@mohitsrivastavaofficial]

13:10 done.

[@gokulnaathb2627]

Sir, very nice explanation, thank you so much

[@HelloWorldbyprince]

You are most welcome

[@devbhattacharya153]

Thanks a lot Prince Bhaiya

[@HelloWorldbyprince]

keep learning bhai

[@nishabharti1971]

Thanks bhaiya

[@HelloWorldbyprince]

Your welcome Nisha Keep learning and sharing my channel with your friends and colleagues

[@cr7johnChan]

Done Bhai!!!!Shukriya

[@HelloWorldbyprince]

🤩🤩

[@sahiltakwale1937]

🙏 Thanks a lot...

[@HelloWorldbyprince]

welcome please please share this channel in your college group

[@jayanth1191]

Great explanation bro 💥

[@HelloWorldbyprince]

Thanks buddy 😊😊

[@color2653]

Thank you bro😀

[@HelloWorldbyprince]

thanks for the support bro

[@AyushGupta-ux4gq]

Thanks bro😁😁

[@HelloWorldbyprince]

Keep learning buddy

[@RN-jo8zt]

definition of height of binary tree is really confusing according to definition Height of Binary tree is the number of edges along the longest path from root to leaf. where leaf node height is 0 . but here it's different and leaf node height is 1. can you pls explain which definition is correct ?

[@wantbebigcoder2117]

Done

[@HelloWorldbyprince]

👏

[@sanjeevgupta2200]

Sir Hume iska iterative solution ni krna haii ?? Ya karna chaiye

[@AmanSingh-ph9wg]

done

[@HelloWorldbyprince]

nice

[@shivduttjha3502]

♥️♥️♥️

[@HelloWorldbyprince]

Thanks buddy for lots of Love

[@jeetkishore7972]

int depth(node* root ) { static int h = 0; if (root == NULL) { return 0 ; } h++; if (root->left == NULL) { depth(root->right); } else if(root->right){ depth(root->left); } else return -1; return h; }

[@HelloWorldbyprince]

good work dost keep learning

[@abhisheksamboddu6580]

class Solution { public: int h=0; int ans=0; int maxDepth(TreeNode* root) { findans(root); return ans; } void findans(TreeNode* root){ if(root!=NULL){ h++; ans=max(ans,h); findans(root->left); findans(root->right); h--; } } };

[@HelloWorldbyprince]

amazing code work bro keep learning like this

[@mdwahid1099]

Sir, very nice explanation, thank you so much

[@HelloWorldbyprince]

You are most welcome

[@anonymous090]

Thank you Bhaiya

[@HelloWorldbyprince]

welcome dear