543. Diameter of Binary Tree(Leetcode每日一题-2020.03.10)

Problem

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

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

Solution

树中的最长路径一共有三种情况

• 通过根节点
• 不通过根节点，在左子树上
• 不通过根节点，在右子树上

所以我们只需要找到上述三种情况中的最大值即可。

对于通过根的最长路径来说，它等于左子树的高度加上右子树的高度。

/**
 * 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 {
public:
    int diameterOfBinaryTree(TreeNode* root) {
        if(!root)
            return 0;
        return max(max(treeDepth(root->left) + treeDepth(root->right),diameterOfBinaryTree(root->left)),diameterOfBinaryTree(root->right));
        
    }

    int treeDepth(TreeNode* root)
    {
        if(!root)
            return 0;
        return max(treeDepth(root->left),treeDepth(root->right)) + 1;
    }
};