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 29 30 31 32
|
class Solution {
int ans;
public int diameterOfBinaryTree(TreeNode root) { dfs(root); return ans; }
private int dfs(TreeNode root) { if (root == null) return -1; int left = dfs(root.left) + 1; int right = dfs(root.right) + 1; ans = Math.max(ans, left + right); return Math.max(left, right); } }
|