-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathflatten_114.cpp
42 lines (38 loc) · 986 Bytes
/
flatten_114.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include<iostream>
#include<vector>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
class Solution {
public:
TreeNode* flattenTree(TreeNode* root){
if(!root)
return nullptr;
TreeNode * tmp = root->right;
if(root->left){
root->right = flattenTree(root->left);
}
TreeNode* lastRight = root->right;
if(!lastRight){
lastRight = root;
}else{
while (lastRight->right)
{
lastRight = lastRight->right;
}
}
if(tmp){
lastRight = flattenTree(tmp);
}
return root;
}
void flatten(TreeNode* root) {
flattenTree(root);
}
};