[N-0] refactor 116

Author: fishercoder1534

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

@@ -2,7 +2,10 @@
 
 import com.fishercoder.common.classes.TreeLinkNode;
 
-/** Given a binary tree
+/**
+ * 116. Populating Next Right Pointers in Each Node
+ *
+ * Given a binary tree
 
  struct TreeLinkNode {
      TreeLinkNode *left;
@@ -32,52 +35,44 @@ You may assume that it is a perfect binary tree (ie, all leaves are at the same
  4->5->6->7 -> NULL */
 
 public class _116 {
-    //credit: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution
-    //based on level order traversal
-    public static 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;
+            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;
                     }
-                    prev = curr.left;
-                }
-                //right child
-                if (curr.right != null) {
-                    if (prev != null) {
-                        prev.next = curr.right;
-                    } else {
-                        head = curr.right;
+                    //right child
+                    if (curr.right != null) {
+                        if (prev != null) {
+                            prev.next = curr.right;
+                        } else {
+                            head = curr.right;
+                        }
+                        prev = curr.right;
                     }
-                    prev = curr.right;
+                    //move to next node
+                    curr = curr.next;
                 }
-                //move to next node
-                curr = curr.next;
+                //move to next level
+                curr = head;
+                head = null;
+                prev = null;
             }
-            //move to next level
-            curr = head;
-            head = null;
-            prev = null;
         }
-
     }
 
-    public static void main(String... args) {
-        TreeLinkNode 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);
-        connect(root);
-    }
-}
+}

src/test/java/com/fishercoder/_116Test.java

@@ -0,0 +1,29 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.TreeLinkNode;
+import com.fishercoder.solutions._116;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+public class _116Test {
+    private static _116.Solution1 solution1;
+    private static TreeLinkNode root;
+
+    @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);
+
+        solution1.connect(root);
+    }
+
+}