543. Diameter of Binary Tree

---

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.

思路：遍历每一个节点，以该节点作为root，计算最长长度，然后根据左子树长度和右子树长度大小，返回最大长度。考虑0和1节点情况。注意其统计路径，所以是节点数减一。

代码1：

/**
 * 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 height(TreeNode* root){
        if(!root) return 0;
        int u=1,v=1;
        if(root->left) {u +=height(root->left);}
        if(root->right) {v +=height(root->right);}
        return u>v?u:v;
    }
    int diameterOfBinaryTree(TreeNode* root) {
        if(!root) return 0;
        int ldia=diameterOfBinaryTree(root->left),rdia=diameterOfBinaryTree(root->right);
        int tmp1=ldia > rdia ? ldia :rdia;
        int tmp2=height(root->right)+height(root->left);
        return tmp1>tmp2 ? tmp1 :tmp2; 
    }
};

代码2：

/**
 * 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 res=0;
    
    int helper(TreeNode* root){
        if(root->left==root->right){return 1;}
        int llen=0,rlen=0;
        if(root->left){llen = helper(root->left);}
        if(root->right){rlen = helper(root->right);}
        if(res<(llen+rlen+1)){res=llen+rlen+1;}
        return llen>rlen?llen+1:rlen+1;
    }
    
    int diameterOfBinaryTree(TreeNode* root) {
        if(!root){return 0;}
        int tp=helper(root);
        return res-1<0?0:res-1;
    }
};