Posted on | Edited on

LeetCode

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/**
 * 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 depth(TreeNode node){
        if(node==null) return 0;
        return 1+Math.max(depth(node.left),depth(node.right));
    }
    public int diameterOfBinaryTree(TreeNode root) {
        if(root==null) return 0;
        int rootDepth=depth(root.left)+depth(root.right);
        int leftDepth=diameterOfBinaryTree(root.left);
        int rightDepth=diameterOfBinaryTree(root.right);
        return Math.max(rootDepth,Math.max(leftDepth,rightDepth));
    }
}

0%