Time: 38 ms (82.85%) | Memory: 17.7 MB (74.69%) - LeetSync

Author: audemed44

543-diameter-of-binary-tree/diameter-of-binary-tree.py

@@ -0,0 +1,23 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def diameterOfBinaryTree(self, root: Optional[TreeNode]) -> int:
+        res = [0]
+
+        def dfs(root):
+            if not root:
+                return 0
+            
+            left = dfs(root.left)
+            right = dfs(root.right)
+            res[0] = max(res[0],left+right)
+
+            return 1 + max(left,right)
+            
+        dfs(root)
+        return res[0]
+