refactor 114

fishercoder1534 · fishercoder1534 · commit 558ecd921715 · 2020-05-11T10:02:15.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_114.java b/src/main/java/com/fishercoder/solutions/_114.java
@@ -2,36 +2,6 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**
- * 114. Flatten Binary Tree to Linked List
- *
- * Given a binary tree, flatten it to a linked list in-place.
-
- For example,
- Given
-
-   1
-  / \
- 2  5
-/ \  \
-3 4  6
-
- The flattened tree should look like:
-  1
-   \
-   2
-    \
-    3
-     \
-     4
-      \
-      5
-       \
-       6
-
- Hints:
- If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.
- */
 public class _114 {
 
     public static class Solution1 {
