[LeeCode] 543. Diameter of Binary Tree (Python)

543. Diameter of Binary Tree

Easy

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Example:
Given a binary tree 

          1
         / \
        2   3
       / \     
      4   5    

 

Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

Note: The length of path between two nodes is represented by the number of edges between them.

 

笔记：DFS

类似于LeeCode 124题 https://blog.csdn.net/Haskei/article/details/106597633

class Solution:
    def diameterOfBinaryTree(self, root: TreeNode) -> int:
        if not root:
            return 0
        rlt = float('-inf')

        def find_diameter(node):
            nonlocal rlt
            if not node:
                return 0
            left_len = find_diameter(node.left)
            right_len = find_diameter(node.right)
            cur_len = max(left_len, right_len) + 1
            rlt = max(rlt, left_len + right_len + 1)
            return cur_len
        find_diameter(root)
        return rlt - 1