# 543. Diameter-of-Binary-Tree

difficulty: Easy

&#x20;section pre{ background-color: #eee; border: 1px solid #ddd; padding:10px; border-radius: 5px; }&#x20;

&#x20;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.

&#x20;**Example:**\
&#x20;Given a binary tree\\

```
          1
         / \
        2   3
       / \     
      4   5    
```

&#x20;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.

## Method One

```java
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    private int maxLength;
    public int diameterOfBinaryTree(TreeNode root) {
        // 我们在每个节点，都统计它左右最深的深度，加一起就是直径了。一直比较这个直径就可以。
        if(root == null) {
            return 0;
        }
        this.maxLength = Integer.MIN_VALUE;
        dfs(root);
        return maxLength;
    }

    public int dfs(TreeNode root) {
        if(root == null) {
            return 0;
        }
        int rightDepth = dfs(root.right);
        int leftDepth = dfs(root.left);
        maxLength = Math.max(maxLength, leftDepth + rightDepth);
        return Math.max(leftDepth, rightDepth) + 1;
    }

}
​
```
