Diameter Of Binary Tree ( Basic Approach) - JAVA

[@CodingNinjasIndia]

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

[@CodingNinjasIndia]

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

[@anjurawat9274]

awesome explanation

[@siddhartharaja9413]

You are genius 🙂🙂🙂

[@piyushbhatia2324]

Really Kool and Easy to Grasp Explanation sir! Tonnes of Love from NIT Durgapur :)

[@tanmoybanerjee761]

very good explanation

[@ibrahimshaikh3642]

Really maza aagaya, The way u explain code for each option

[@subhashvadlamani9412]

There is a mistake in your code sir. option1 = height(root.left) + height(root.right) + 1. You missed the '+1' part.

[@RishiPrakash]

Damn it!! Thank God someone noticed it. This was bugging me for so long.

[@asifnasim1209]

I think he is taking the edges not the nodes itself, so if you are taking nodes for calculating the height, then you will need +1 in option1.

[@jagritbudhiraja6391]

Yes

[@amitagarwal2460]

awesome teacher !

[@jiosim1377]

U didnt explain ehy the complexity is n*h u just concluded it without any logic