Fixed checkstyle warnings.

Author: javadev

src/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.java

@@ -16,14 +16,18 @@ public int minDepth(TreeNode root) {
             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);
+                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;
     }
 }

src/main/java/g0101_0200/s0113_path_sum_ii/Solution.java

@@ -7,7 +7,9 @@
 public class Solution {
     public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
         List<List<Integer>> res = new ArrayList<>();
-        if (root == null) return res;
+        if (root == null) {
+            return res;
+        }
         recur(res, new ArrayList<>(), 0, targetSum, root);
         return res;
     }