Interview Problem: How to Calculate the Diameter of a Binary Tree in C++ ( Basic Approach)

[@CodingNinjasIndia]

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

[@uvraysyt_]

Amazing

[@shubhendurajput1360]

Thanks for explaining it so well. Please fix your title. This video should be categorized under Better Approach rather than Basic.

[@sourav3751]

Very Well Explained Sir👌👌

[@PrashantMishra-nk9nl]

I wonder only 4 comments till now!!

[@derilraju2106]

Python class Solution: def diameterOfBinaryTree(self, root: Optional[TreeNode]) -> int: def diameter(root): if not root: return 0,0 ld, lh = diameter(root.left) rd, rh = diameter(root.right) d = max(lh+rh,max(ld,rd)) h = 1 + max(lh,rh) return d,h return diameter(root)[0]

[@abhaypatil1252]

Change the title to better approach instead of basic approach.

[@aparna8338]

Pls do courses in English also