Updated Minimum Depth of a Binary Tree.java

varunu28 · varunu28 · commit f38831aadfe1 · 2023-07-09T18:46:15.000-07:00
diff --git a/Easy/Minimum Depth of a Binary Tree.java b/Easy/Minimum Depth of a Binary Tree.java
@@ -14,31 +14,29 @@
  * }
  */
 class Solution {
-  public int minDepth(TreeNode root) {
-    if (root == null) {
-      return 0;
-    }
-    int steps = 1;
-    Queue<TreeNode> queue = new LinkedList<>();
-    queue.add(root);
-    while (!queue.isEmpty()) {
-      int size = queue.size();
-      // Level iteration
-      while (size-- > 0) {
-        TreeNode removed = queue.remove();
-        // Leaf reached
-        if (removed.left == null && removed.right == null) {
-          return steps;
-        }
-        if (removed.left != null) {
-          queue.add(removed.left);
+    public int minDepth(TreeNode root) {
+        if (root == null) {
+            return 0;
         }
-        if (removed.right != null) {
-          queue.add(removed.right);
+        int level = 1;
+        Queue<TreeNode> queue = new LinkedList<>();
+        queue.add(root);
+        while (!queue.isEmpty()) {
+            int size = queue.size();
+            while (size-- > 0) {
+                TreeNode removed = queue.remove();
+                if (removed.left == null && removed.right == null) {
+                    return level;
+                }
+                if (removed.left != null) {
+                    queue.add(removed.left);
+                }
+                if (removed.right != null) {
+                    queue.add(removed.right);
+                }
+            }
+            level++;
         }
-      }
-      steps++;
+        return level;
     }
-    return steps;
-  }
 }
