-
Notifications
You must be signed in to change notification settings - Fork 0
/
L107_BinaryTreeLevelOrderTraversalII.c
165 lines (144 loc) · 3.57 KB
/
L107_BinaryTreeLevelOrderTraversalII.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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
/*
url: leetcode.com/problems/binary-tree-level-order-traversal-ii
AC 3ms 28.85%
*/
#include <stdio.h>
#include <stdlib.h>
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
};
typedef struct TreeNode * ptn;
typedef struct TreeNode stn;
typedef int* T;
typedef struct al sal;
typedef struct al * pal;
struct al {
int capacity;
int size;
T* arr;
};
pal al_init(int capacity) {
pal l = (pal) malloc(sizeof(sal));
if (capacity < 1) return NULL;
l->arr = (T*) malloc(sizeof(T) * capacity);
l->capacity = capacity;
l->size = 0;
return l;
}
void al_expand_capacity(pal l) {
T* new_arr = (T*) malloc(sizeof(T) * (l->capacity * 2 + 1));
int i = 0;
for (i = 0; i < l->capacity; i ++)
new_arr[i] = l->arr[i];
free(l->arr);
l->arr = new_arr;
l->capacity = l->capacity * 2 + 1;
}
void al_add_last(pal l, T v) {
if (l->capacity == l->size) al_expand_capacity(l);
l->arr[l->size] = v;
l->size ++;
}
void al_free_all(pal l) {
int i = 0;
for (i = 0; i < l->size; i ++)
free(l->arr[i]);
free(l->arr);
free(l);
}
T* al_convert_to_array_free_l(pal l) {
T* arr = l->arr;
free(l);
return arr;
}
typedef ptn V;
typedef struct sl ssl;
typedef struct sl * psl;
struct sl {
int capacity;
int size;
V* arr;
};
psl sl_init(int capacity) {
psl l = (psl) malloc(sizeof(ssl));
if (capacity < 1) return NULL;
l->arr = (V*) malloc(sizeof(V) * capacity);
l->capacity = capacity;
l->size = 0;
return l;
}
void sl_expand_capacity(psl l) {
V* new_arr = (V*) malloc(sizeof(V) * (l->capacity * 2 + 1));
int i = 0;
for (i = 0; i < l->capacity; i ++)
new_arr[i] = l->arr[i];
free(l->arr);
l->arr = new_arr;
l->capacity = l->capacity * 2 + 1;
}
void sl_add_last(psl l, V v) {
if (l->capacity == l->size) sl_expand_capacity(l);
l->arr[l->size] = v;
l->size ++;
}
void sl_free_all(psl l) {
free(l->arr);
free(l);
}
void swap_psl(psl* l1, psl* l2) {
psl l = *l1;
*l1 = *l2;
*l2 = l;
}
void swap_int_star(int** a, int** b) {
int* c = *a;
*a = *b;
*b = c;
}
void reverse(pal l) {
int i = 0, j = l->size - 1;
while (i < j) {
swap_int_star(&(l->arr[i]), &(l->arr[j]));
i ++;
j --;
}
}
int** levelOrderBottom(ptn n, int** cn, int* rn) {
psl l1 , l2 ;
int i = 0, i2 = 0, *t = NULL;
pal l = NULL, ln = NULL;
if (n == NULL) return NULL;
l1 = sl_init(16);
l2 = sl_init(16);
l = al_init(16);
ln = al_init(16);
sl_add_last(l1, n);
while (l1->size != 0) {
t = (int*) malloc(sizeof(int) * l1->size);
for (i = 0; i < l1->size; i ++)
t[i] = l1->arr[i]->val;
al_add_last(l, t);
t = (int*) malloc(sizeof(int) * 1);
t[0] = l1->size;
al_add_last(ln, t);
l2->size = 0;
for (i = 0; i < l1->size; i ++) {
if (l1->arr[i]->left != NULL)
sl_add_last(l2, l1->arr[i]->left);
if (l1->arr[i]->right != NULL)
sl_add_last(l2, l1->arr[i]->right);
}
swap_psl(&l1, &l2);
}
sl_free_all(l1);
sl_free_all(l2);
*cn = (int*) malloc(sizeof(int) * ln->size);
for (i = 0; i < ln->size; i ++)
(*cn)[ln->size - 1- i] = ln->arr[i][0];
al_free_all(ln);
*rn = l->size;
reverse(l);
return al_convert_to_array_free_l(l);
}