-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtree_traverse.cc
More file actions
253 lines (224 loc) · 4.38 KB
/
Copy pathtree_traverse.cc
File metadata and controls
253 lines (224 loc) · 4.38 KB
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
#include "tree_definition.h"
#include <cstddef>
#include <assert.h>
funcTravel fns[] = {
Trav_preorder_recur,
Trav_inorder_recur,
Trav_postorder_recur,
Trav_preorder_goto,
Trav_inorder_goto,
Trav_postorder_goto,
Trav_preorder_loop,
Trav_inorder_loop,
Trav_postorder_loop
};
void Trav_inorder_recur(TreeNode_p_t node, funcVisitor fn)
{
if(!node)
return;
Trav_inorder_recur(node->lchild, fn);
fn(node);
Trav_inorder_recur(node->rchild, fn);
}
void Trav_preorder_recur(TreeNode_p_t node, funcVisitor fn)
{
if(!node)
return;
fn(node);
Trav_preorder_recur(node->lchild, fn);
Trav_preorder_recur(node->rchild, fn);
}
void Trav_postorder_recur(TreeNode_p_t node, funcVisitor fn)
{
if(!node)
return;
Trav_postorder_recur(node->lchild, fn);
Trav_postorder_recur(node->rchild, fn);
fn(node);
}
void Trav_inorder_loop(TreeNode_p_t root, funcVisitor fn)
{
if(!root)
return;
TreeNode_p_t curr = root;
bool leafReturn = false;
while(curr) {
while (curr->lchild && !leafReturn) {
curr = curr->lchild;
leafReturn = false;
}
assert(curr);
fn(curr);
if(curr->rchild) {
curr = curr->rchild;
leafReturn = false;
continue;
} else {
leafReturn = true;
while(true){
//curr is leaf
if( !curr || curr == root)
return;
bool isVisited = curr == curr->parent->rchild;
curr = curr->parent;
if (isVisited)
continue;
else
break;
}
}
}
}
void Trav_preorder_loop(TreeNode_p_t root, funcVisitor fn)
{
if(!root)
return;
TreeNode_p_t curr = root;
while(curr){
assert(curr);
fn(curr);
if (curr->lchild) {
curr = curr->lchild;
continue;
}
if(curr->rchild) {
curr = curr->rchild;
continue;
} else {
while(true){
if(curr == root || !curr )
return;
bool isRLeaf = curr == curr->parent->rchild;
if(isRLeaf && root == curr->parent)
return;
TreeNode_p_t next = isRLeaf? NULL : curr->parent->rchild;
if (next){
curr = next;
break;
}
curr = curr->parent;
}
}
}
}
void Trav_postorder_loop(TreeNode_p_t root, funcVisitor fn)
{
if(!root)
return;
TreeNode_p_t curr = root;
while(true){
while (curr->lchild)
curr = curr->lchild;
assert(curr);
if(curr->rchild) {
curr = curr->rchild;
continue;
} else {
while(true){
fn(curr);
if(curr == root){
return;
}
bool isRLeaf = curr == curr->parent->rchild;
TreeNode_p_t next = isRLeaf? curr->parent : curr->parent->rchild;
if (!isRLeaf && next){
curr = next;
break;
}
curr = curr->parent;
}
}
}
}
void Trav_inorder_goto(TreeNode_p_t root, funcVisitor fn)
{
if(!root)
return;
TreeNode_p_t curr = root;
trval_start:
while (curr->lchild)
curr = curr->lchild;
leaf_return:
assert(curr);
fn(curr);
if(curr->rchild) {
curr = curr->rchild;
goto trval_start;
} else {
leaf_find_unvisited:
if(curr == root || !curr )
goto trval_end;
//curr is leaf
bool isVisited = curr == curr->parent->rchild;
curr = curr->parent;
if (isVisited)
goto leaf_find_unvisited ;
goto leaf_return;
}
trval_end: return;
}
void Trav_preorder_goto(TreeNode_p_t root, funcVisitor fn)
{
if(!root)
return;
TreeNode_p_t curr = root;
trval_start:
assert(curr);
fn(curr);
if (curr->lchild) {
curr = curr->lchild;
goto trval_start;
}
if(curr->rchild) {
curr = curr->rchild;
goto trval_start;
} else {
leaf_find_unvisited:
if(curr == root || !curr )
goto trval_end;
bool isRLeaf = curr == curr->parent->rchild;
if(isRLeaf && root == curr->parent)
goto trval_end;
TreeNode_p_t next = isRLeaf? NULL : curr->parent->rchild;
if (next){
curr = next;
goto trval_start;
}
curr = curr->parent;
goto leaf_find_unvisited;
}
trval_end: return;
}
void Trav_postorder_goto(TreeNode_p_t root, funcVisitor fn)
{
if(!root)
return;
TreeNode_p_t curr = root;
trval_start:
while (curr->lchild)
curr = curr->lchild;
assert(curr);
if(curr->rchild) {
curr = curr->rchild;
goto trval_start;
} else {
leaf_find_unvisited:
fn(curr);
if(curr == root){
goto trval_end;
}
bool isRLeaf = curr == curr->parent->rchild;
TreeNode_p_t next = isRLeaf? curr->parent : curr->parent->rchild;
if (!isRLeaf && next){
curr = next;
goto trval_start;
}
curr = curr->parent;
goto leaf_find_unvisited;
}
trval_end: return;
}
void TREE_traverse(TRAVEL_type_t mode, TreeNode_p_t root, funcVisitor fnVisit)
{
return fns[mode](root, fnVisit);
}