[leetcode]543. Diameter of Binary Tree

题目链接：https://leetcode.com/problems/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 longestpath 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.

---

class Solution {
public:
    int diameterOfBinaryTree(TreeNode* root) {
        int dia = 0;
        diameter(root, dia);
        return dia;
    }
    
    int diameter(TreeNode* root, int& dia) {
        if(!root)
            return 0;
        int l = diameter(root->left, dia);
        int r = diameter(root->right, dia);
        dia = max(dia, l + r);
        return max(l, r) + 1;
    }
};

解题思路

• 二叉树的直径：二叉树中从一个结点到另一个节点最长的路径，叫做二叉树的直径
• 采用分治和递归的思想：根节点为root的二叉树的直径 = max(root-left的直径，root->right的直径，root->left的最大深度+root->right的最大深度)

class Solution {
public:
    int diameterOfBinaryTree(TreeNode* root)
    {
        if(root == nullptr)
            return 0;
        int d_l=diameterOfBinaryTree(root->left);
        int d_r = diameterOfBinaryTree(root->right);
        int height_l=getHeight(root->left);
        int height_r=getHeight(root->right);

        return max(max(d_l,d_r),height_l+height_r);
    }
// 获得二叉树的最大深度
    int getHeight(TreeNode* root)
    {
        if(root == nullptr)
            return 0;
        int h_l=getHeight(root->left);
        int h_r=getHeight(root->right);
        return max(h_l,h_r)+1;
    }
};