forked from lennylxx/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
114.c
70 lines (57 loc) · 1.35 KB
/
114.c
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
};
void flattenHelper(struct TreeNode* root, struct TreeNode **start, struct TreeNode **end){
if (root == NULL) {
*start = *end = NULL;
return;
}
struct TreeNode *lstart, *lend, *rstart, *rend;
lstart = lend = rstart = rend = NULL;
flattenHelper(root->left, &lstart, &lend);
flattenHelper(root->right, &rstart, &rend);
root->left = NULL;
if (lend != NULL) {
root->right = lstart;
lend->right = rstart;
}
else {
root->right = rstart;
}
*start = root;
if (rend != NULL) {
*end = rend;
}
else if (lend != NULL) {
*end = lend;
}
else {
*end = root;
}
}
void flatten(struct TreeNode* root) {
struct TreeNode *start, *end;
start = end = NULL;
flattenHelper(root, &start, &end);
}
int main() {
struct TreeNode *root = (struct TreeNode *)calloc(3, sizeof(struct TreeNode));
root->val = 1;
root->left = root + 1;
root->left->val = 2;
root->left->left = root + 2;
root->left->left->val = 3;
flatten(root);
while (root) {
assert(root->left == NULL);
printf("%d ", root->val);
root = root->right;
}
printf("\n");
return 0;
}