refactor 117

fishercoder1534 · fishercoder1534 · commit 3fa458546037 · 2020-05-12T07:49:48.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_117.java b/src/main/java/com/fishercoder/solutions/_117.java
@@ -2,33 +2,12 @@
 
 import com.fishercoder.common.classes.TreeLinkNode;
 
-/**
- * 117. Populating Next Right Pointers in Each Node II
- *
- * Follow up for problem "Populating Next Right Pointers in Each Node".
- * What if the given tree could be any binary tree? Would your previous solution still work?
-
- Note:
-
- You may only use constant extra space.
- For example,
- Given the following binary tree,
-      1
-    /  \
-   2    3
-  / \    \
- 4   5    7
- After calling your function, the tree should look like:
-      1 -> NULL
-    /  \
-   2 -> 3 -> NULL
-  / \    \
- 4-> 5 -> 7 -> NULL */
-
 public class _117 {
     public static class Solution1 {
-        /**credit: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution
-        O(1) space, based on level order traversal*/
+        /**
+         * credit: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution
+         * O(1) space, based on level order traversal
+         */
         public void connect(TreeLinkNode root) {
 
             TreeLinkNode head = null; //head of the next level
