-
Notifications
You must be signed in to change notification settings - Fork 56
/
Solution.java
51 lines (48 loc) · 1.42 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
43
44
45
46
47
48
49
50
51
package g0101_0200.s0111_minimum_depth_of_binary_tree;
// #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Udemy_Tree_Stack_Queue
// #2022_06_23_Time_1_ms_(97.49%)_Space_97_MB_(5.22%)
import com_github_leetcode.TreeNode;
import java.util.LinkedList;
import java.util.Queue;
/*
* 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 {
public int minDepth(TreeNode root) {
if (root == null) {
return 0;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
int d = 0;
while (!queue.isEmpty()) {
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode current = queue.poll();
if (current.left == null && current.right == null && d > 0) {
return d + 1;
}
if (current.right != null) {
queue.add(current.right);
}
if (current.left != null) {
queue.add(current.left);
}
}
d++;
}
return d;
}
}