测量每个节点左子树和右子树的最长长度,并记录最长的左子树+右子树长度(直径),因为直径可能出现在任意一个节点上,所以要测量所有节点。
# 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: TreeNode) -> int:
self.max = 0
self.depth(root)
return self.max
def depth(self, root):
if not root:
return 0
l = self.depth(root.left)
r = self.depth(root.right)
self.max = max(self.max, l+r)
return max(l, r) + 1