We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e967ff5 commit 558ecd9Copy full SHA for 558ecd9
src/main/java/com/fishercoder/solutions/_114.java
@@ -2,36 +2,6 @@
2
3
import com.fishercoder.common.classes.TreeNode;
4
5
-/**
6
- * 114. Flatten Binary Tree to Linked List
7
- *
8
- * Given a binary tree, flatten it to a linked list in-place.
9
-
10
- For example,
11
- Given
12
13
- 1
14
- / \
15
- 2 5
16
-/ \ \
17
-3 4 6
18
19
- The flattened tree should look like:
20
21
- \
22
- 2
23
24
- 3
25
26
- 4
27
28
- 5
29
30
- 6
31
32
- Hints:
33
- If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.
34
- */
35
public class _114 {
36
37
public static class Solution1 {
0 commit comments