Time: 2 ms (95.05%), Space: 82.3 MB (19.16%) - LeetHub

Author: SHIMHUN

LeetCode/Easy/0111-minimum-depth-of-binary-tree/0111-minimum-depth-of-binary-tree.java

@@ -38,15 +38,14 @@ public int minDepth(TreeNode root) {
 
         while(!queue.isEmpty()){
             int queueLen = queue.size();
+            minDepth++;
 
             while(queueLen-->0){
                 TreeNode node = queue.poll();
                 if(node.left==null && node.right==null) return minDepth;
                 if(node.left!=null) queue.add(node.left);
                 if(node.right!=null) queue.add(node.right);
-            }
-
-            minDepth++;
+            }   
         }  
 
         return minDepth;