refactor 116

fishercoder1534 · fishercoder1534 · commit 0522cd89456e · 2021-10-10T16:39:36.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_116.java b/src/main/java/com/fishercoder/solutions/_116.java
@@ -2,6 +2,9 @@
 
 import com.fishercoder.common.classes.TreeLinkNode;
 
+import java.util.LinkedList;
+import java.util.Queue;
+
 public class _116 {
     public static class Solution1 {
         /**
@@ -44,4 +47,35 @@ public void connect(TreeLinkNode root) {
             }
         }
     }
+
+    public static class Solution2 {
+        /**
+         * My complete original solution on 10/10/2021.
+         */
+        public TreeLinkNode connect(TreeLinkNode root) {
+            if (root == null) {
+                return null;
+            }
+            Queue<TreeLinkNode> queue = new LinkedList<>();
+            queue.offer(root);
+            while (!queue.isEmpty()) {
+                int size = queue.size();
+                for (int i = 0; i < size; i++) {
+                    TreeLinkNode curr = queue.poll();
+                    if (i < size - 1) {
+                        curr.next = queue.peek();
+                    } else {
+                        curr.next = null;
+                    }
+                    if (curr.left != null) {
+                        queue.offer(curr.left);
+                    }
+                    if (curr.right != null) {
+                        queue.offer(curr.right);
+                    }
+                }
+            }
+            return root;
+        }
+    }
 }
