Diameter of Binary Tree

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.

 

采用递归，传入根节点，从最浅层节点的深度标记为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 {
int re;
public:
    int diameterOfBinaryTree(TreeNode* root) {
        re=0;
        depth(root);
        return re;
    }
    
    int depth(TreeNode*root)
    {
        if(root==nullptr)
            return 0;
        int leftDepth=depth(root->left);
        
        int rightDepth=depth(root->right);
        
        re=max(re,leftDepth+rightDepth);
        return max(leftDepth,rightDepth)+1;
    }       
};