Tree——No.543 Diameter of Binary Tree

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.

Explanation：

计算二叉树的直径，直径就是从一个结点到另一个结点最长距离，距离是指结点的边数。

My Thinking：

直径一定是两个叶子结点之间的路径，从每个叶子开始记录每个结点到叶子的最大长度，每次更新经过当前结点的最长路径即可。

My Solution：

class Solution {
    private int diameter=0;
    public int diameterOfBinaryTree(TreeNode root) {
        recursive(root);
        return diameter;
    }
     public int recursive(TreeNode root) {
       if(root==null)
            return 0;
        int leftmax=recursive(root.left);
        int rightmax=recursive(root.right);
        int currentmax=leftmax+rightmax;
        if(currentmax>diameter)
            diameter=currentmax;
        return Math.max(leftmax,rightmax)+1;
    }
}

Optimum Thinking:

Optimum Solution：