/
Solution.java
42 lines (37 loc) · 1.25 KB
/
Solution.java
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
33
34
35
36
37
38
39
40
41
42
package g0501_0600.s0543_diameter_of_binary_tree;
// #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
// #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
// #2022_08_02_Time_1_ms_(65.86%)_Space_43.5_MB_(33.52%)
import com_github_leetcode.TreeNode;
/*
* 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;
* }
* }
*/
public class Solution {
private int diameter;
public int diameterOfBinaryTree(TreeNode root) {
diameter = 0;
diameterOfBinaryTreeUtil(root);
return diameter;
}
private int diameterOfBinaryTreeUtil(TreeNode root) {
if (root == null) {
return 0;
}
int leftLength = root.left != null ? 1 + diameterOfBinaryTreeUtil(root.left) : 0;
int rightLength = root.right != null ? 1 + diameterOfBinaryTreeUtil(root.right) : 0;
diameter = Math.max(diameter, leftLength + rightLength);
return Math.max(leftLength, rightLength);
}
}