[leetcode] 543. Diameter of Binary Tree

Description

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.

分析

题目的意思是：求一个二叉树最长的路径长度，起点不一定是根节点。

• 思路是我们在递归的时候，只需要选择选择当前结点分支的最大长度返回就行了，即max(left,right)+1；当然，res就是左右分支的和了。

代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    int res=0;
public:
    int diameterOfBinaryTree(TreeNode* root) {
        maxDepth(root);
        return res;
    }
    int maxDepth(TreeNode* root){
        if(!root){
            return 0;
        }
        int left=maxDepth(root->left);
        int right=maxDepth(root->right);
        res=max(res,left+right);
        return max(left,right)+1;
    }
};

代码二 Python

这道题如果能想到按照求left和right分支最大长度，然后ans是左右分支长度的和，这两点就能做出来。

# 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:
    res = 0

    def solve(self, root):
        if root is None:
            return 0
        l = self.solve(root.left)
        r = self.solve(root.right)
        self.res = max(self.res, l+r)
        return max(l,r)+1

    def diameterOfBinaryTree(self, root: Optional[TreeNode]) -> int:
        self.solve(root)
        return self.res

参考文献

LeetCode 543. Diameter of Binary Tree 解题笔记