543. Diameter of Binary Tree

题目

代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = Noneclass Solution:def diameterOfBinaryTree(self, root: TreeNode) -> int:self.ans = 0def depth(root):if not root: return 0left = depth(root.left)right = depth(root.right)# pathself.ans = max(self.ans, left + right)# depthreturn max(left, right) + 1depth(root)return self.ans