-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFlattenBinaryTreeToLinkedList.cpp
More file actions
53 lines (49 loc) · 952 Bytes
/
Copy pathFlattenBinaryTreeToLinkedList.cpp
File metadata and controls
53 lines (49 loc) · 952 Bytes
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
43
44
45
46
47
48
49
50
51
52
53
/**
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
*/
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void flatten(TreeNode *root) {
while (root) {
if (root->left) {
TreeNode* p = root->left;
while (p->right) {
p = p->right;
}
//swap pointers
p->right = root->right;
root->right = root->left;
root->left = NULL;
}
root = root->right;
}
}
};