refactor 116

fishercoder1534 · fishercoder1534 · commit f57f8605f3dc · 2018-03-30T07:26:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_116.java b/src/main/java/com/fishercoder/solutions/_116.java
@@ -4,8 +4,8 @@
 
 /**
  * 116. Populating Next Right Pointers in Each Node
- *
- * Given a binary tree
+
+ Given a binary tree
 
  struct TreeLinkNode {
      TreeLinkNode *left;
@@ -27,52 +27,55 @@ You may assume that it is a perfect binary tree (ie, all leaves are at the same
    2    3
   / \  / \
  4  5  6  7
+
  After calling your function, the tree should look like:
       1 -> NULL
     /  \
    2 -> 3 -> NULL
   / \  / \
- 4->5->6->7 -> NULL */
+ 4->5->6->7 -> NULL
+ */
 
 public class _116 {
-    public static class Solution1 {
-        //credit: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution
-        //based on level order traversal
-        public void connect(TreeLinkNode root) {
+  public static class Solution1 {
+    /**
+     * credit: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution
+     * based on level order traversal
+     */
+    public void connect(TreeLinkNode root) {
 
-            TreeLinkNode head = null; //head of the next level
-            TreeLinkNode prev = null; //the leading node on the next level
-            TreeLinkNode curr = root;  //current node of current level
+      TreeLinkNode head = null; //head of the next level
+      TreeLinkNode prev = null; //the leading node on the next level
+      TreeLinkNode curr = root;  //current node of current level
 
-            while (curr != null) {
-                while (curr != null) { //iterate on the current level
-                    //left child
-                    if (curr.left != null) {
-                        if (prev != null) {
-                            prev.next = curr.left;
-                        } else {
-                            head = curr.left;
-                        }
-                        prev = curr.left;
-                    }
-                    //right child
-                    if (curr.right != null) {
-                        if (prev != null) {
-                            prev.next = curr.right;
-                        } else {
-                            head = curr.right;
-                        }
-                        prev = curr.right;
-                    }
-                    //move to next node
-                    curr = curr.next;
-                }
-                //move to next level
-                curr = head;
-                head = null;
-                prev = null;
+      while (curr != null) {
+        while (curr != null) { //iterate on the current level
+          //left child
+          if (curr.left != null) {
+            if (prev != null) {
+              prev.next = curr.left;
+            } else {
+              head = curr.left;
             }
+            prev = curr.left;
+          }
+          //right child
+          if (curr.right != null) {
+            if (prev != null) {
+              prev.next = curr.right;
+            } else {
+              head = curr.right;
+            }
+            prev = curr.right;
+          }
+          //move to next node
+          curr = curr.next;
         }
+        //move to next level
+        curr = head;
+        head = null;
+        prev = null;
+      }
     }
-
-}
+  }
+}
diff --git a/src/test/java/com/fishercoder/_116Test.java b/src/test/java/com/fishercoder/_116Test.java
@@ -6,24 +6,23 @@
 import org.junit.Test;
 
 public class _116Test {
-    private static _116.Solution1 solution1;
-    private static TreeLinkNode root;
+  private static _116.Solution1 solution1;
+  private static TreeLinkNode root;
 
-    @BeforeClass
-    public static void setup() {
-        solution1 = new _116.Solution1();
-    }
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _116.Solution1();
+  }
 
-    @Test
-    public void test1() {
-        root = new TreeLinkNode(1);
-        root.left = new TreeLinkNode(2);
-        root.right = new TreeLinkNode(3);
-        root.left.left = new TreeLinkNode(4);
-        root.left.right = new TreeLinkNode(5);
-        root.right.right = new TreeLinkNode(7);
+  @Test
+  public void test1() {
+    root = new TreeLinkNode(1);
+    root.left = new TreeLinkNode(2);
+    root.right = new TreeLinkNode(3);
+    root.left.left = new TreeLinkNode(4);
+    root.left.right = new TreeLinkNode(5);
+    root.right.right = new TreeLinkNode(7);
 
-        solution1.connect(root);
-    }
-
-}
+    solution1.connect(root);
+  }
+}
