refactor for format

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_103.java

@@ -33,7 +33,9 @@ public class _103 {
     public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
         Queue<TreeNode> q = new LinkedList();
         List<List<Integer>> levels = new ArrayList();
-        if (root == null) return levels;
+        if (root == null) {
+            return levels;
+        }
         q.offer(root);
         boolean forward = true;
         while (!q.isEmpty()) {
@@ -42,8 +44,12 @@ public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
             for (int i = 0; i < size; i++) {
                 TreeNode curr = q.poll();
                 level.add(curr.val);
-                if (curr.left != null) q.offer(curr.left);
-                if (curr.right != null) q.offer(curr.right);
+                if (curr.left != null) {
+                    q.offer(curr.left);
+                }
+                if (curr.right != null) {
+                    q.offer(curr.right);
+                }
             }
             if (forward) {
                 forward = false;