Diameter of Binary Tree | Tree Data Structure playlist C++ | Hello World | Hindi

[@SaumyaSharma007]

Salute to your explanation bhaiya😃

[@HelloWorldbyprince]

Thanks a lot yaar, Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@saurabhsomvanshi6986]

kya baat he … kya explanations tha🫡🫡. Very nice teaching skills👌👌👌

[@hackstreet781]

Long live Hello World !!! Bravo !!! I understood now. For past 2 days I was cursing myself that I am not able to write a naive solution.

[@HelloWorldbyprince]

Hahah ...aisa nahi hai bro sab samajh me aa jayega dhere dhere

[@alexmercer5870]

Naive approach is so nicely explained. Codingninja aur pepcoding mein bhi itna accha se nai smjh paaya tha Yaha smjha 🤧❤️

[@HelloWorldbyprince]

Waoo, that's why Hello world 🙂 is there

[@chanchalkaushik6320]

Bhaiya app explain bahut accha karte h good job now my all doubts are clear

[@GuluGupta-yv5gl]

wow great explanation prince bhai 🤩

[@HelloWorldbyprince]

Thanks a lot yaar

[@sarikasaxena5567]

one of the best explanation

[@HelloWorldbyprince]

Glad it was helpful!

[@abhinavrajsingh5262]

awesome sir thanks 🙂

[@HelloWorldbyprince]

Keep learning buddy ☺️

[@chaitanyakarthikbasva]

very nice explanation

[@HelloWorldbyprince]

Thanks for liking

[@rohitkeshari56]

This is best rxplanation of this question in the whole youtube till now

[@HelloWorldbyprince]

Thanks Rohit yaar please share this channel

[@sohebshaikh3344]

Khatarnak Explanation tha bhaiya

[@kushalshukla444]

bro ur explaination is smooth !!

[@HelloWorldbyprince]

Thanks kushal

[@maniish-sgh]

Done !!

[@devanshpandey3994]

Best explanation!

[@HelloWorldbyprince]

Just share my channel with your friends and colleagues

[@priyabansal9911]

👌👌 Awesome video

[@HelloWorldbyprince]

Keep learning

[@ALEEMKHAWAR1]

very well explained ,small trick in algo improve the time compexity O(n) from O(n2)

[@HelloWorldbyprince]

yess😄

[@omkarpatil9886]

how ??

[@rajputravi_27]

great sir

[@HelloWorldbyprince]

Thanks a lot

[@gokulnaathb2627]

Bhaiya, bahut achha feel aaya😀 Thank you so much

[@HelloWorldbyprince]

Keep learning buddy

[@shubhampatel6325]

Jahar sir, heavy driver ho aap coding ki duniya me

[@HelloWorldbyprince]

Ekdum bhai ❤️

[@kavyaanand1229]

Just got another reason to study trees.

[@sarthakuiit]

Thank you for wonderful explanation Prince bhai. Just a thought : diameter = Math.max(diameter, lh + rh); counts the exact diameter. Then we don't need to count nodes and then do -1 in result.

[@HelloWorldbyprince]

Yes, you are right

[@kushalshukla444]

bhai time complexity o(n) hogi na

[@Thangarajkumarslm]

Sir can you speak English

[@HelloWorldbyprince]

I will try buddy

[@Thangarajkumarslm]

Ok sir