leetcode 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 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.

思路：分治

1.求以当前节点为根的直径

2.整个左子树中最大直径

3.整个右子树中最大直径

4.整合以上三种情况，比较三者最大值返回

代码：

class Solution {
    public int diameterOfBinaryTree(TreeNode root) {   
        if(root == null) return 0;
        int left = diameterOfBinaryTree(root.left);
        int right = diameterOfBinaryTree(root.right);
        int cur = depth(root.left) + depth(root.right);
        return Math.max(cur , Math.max(left , right));
    } 
    public static int depth(TreeNode root){     //求树的深度
        if(root == null)return 0;
        int left = depth(root.left);
        int right = depth(root.right);
        return (left>right?left:right)+1;
    }
}