How to Find the Diameter Of Binary Tree(Better Approach) - C++

[@CodingNinjasIndia]

Register for Coding Ninjas Scholarship Programme: bit.ly/CNSCHOLARSHIP

[@NaveensinglaYT]

its been 4 years since this video was posted but it is still the best video on the internet

[@yuv54]

Man!! Enjoyed a lot. Very well explanation and love the way you explain. Keep it up...

[@anujjadhav2771]

Very well explained, also which editor is sir using?

[@abhi4unme2002]

height in case of null should be -1 not zero, if you assume height of root is 0 not 1.

[@geekySRM]

If you do -1, then you should do leftHeight + rightHeight + 2.. which is the same thing what Sir did.

[@debasismandal1924]

I'm a simple person I see vi I press like

[@namantiwari7155]

Amazing explanations, helped me a lot!

[@RCorpVideos]

Hi Sir, I think in height() one more if condition should be there for checking the leaf and here is the total code for finding the height of the binary tree. Well I am writing this code in C language. int height(struct node *head){ if(!head){ return 0; } if(!head->left && !head->right){ return 0; } return 1+ max(height(head->left),height(head->right)); }

[@mohitarora2190]

yeah but this condition is not necessary. it will still work without this condition.

[@sarfarazalam6077]

Great explaination. Thank you!

[@CodingNinjasIndia]

Thank you

[@kaushtubrawat6114]

Very nicely explained.. thnx sir

[@mohitarora2190]

how it this better? it is doing it in O(n2) time complexity

[@abhishekgautam1063]

In which course this topic is been taught?

[@MultiSudipta]

Data structure, algorithm....

[@vivekgr3001]

Good explanation

[@neetisharma3768]

thank you :)

[@aniketsriwastva6345]

Great explaination

[@letsrock7354]

well explained

[@durbijkewat7671]

Diameter Of Binary Tree = left_height + right_height + 1

[@CodingNinjasIndia]

IGot queries related to Binary tree , Let us know in the comments section In this video you will learn how to calculate the diameter of a Binary tree with a slightly different approach. 0:20: Diameter of a Binary Tree. 2:06 : Assumptions for calculating the diameter of a Binary tree. 3:10 Condition where diameter of binary tree will be the sum of lh and rh. 3:30 Condition where both the nodes are on the left side in that case lhe diameter will be ld. 3:35 Condition where both the nodes are on the right side in that case the diameter will be rd. 4:30 Code for the problem 10:00 Time complexity for Binary tree.

[@CodingNinjasIndia]

Join our Coding Ninjas official telegram community here: t.me/codingninjas_official

[@rockerboy4184]

Please make your videos in English