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 2a47957 commit 8cac56dCopy full SHA for 8cac56d
LeetCode/0114.Flatten Binary Tree to Linked List/src/Solution.java
@@ -0,0 +1,22 @@
1
+class Solution {
2
+ public void flatten(TreeNode root) {
3
+ if(root == null){
4
+ return;
5
+ }
6
+ merge(root);
7
8
+
9
+ public TreeNode merge(TreeNode node){
10
+ if(node == null){
11
+ return null;
12
13
+ TreeNode leftEnd = merge(node.left);
14
+ TreeNode rightEnd = merge(node.right);
15
+ if(leftEnd != null){
16
+ leftEnd.right = node.right;
17
+ node.right = node.left;
18
+ node.left = null;
19
20
+ return rightEnd == null ? (leftEnd == null ? node : leftEnd) : rightEnd;
21
22
+}
0 commit comments