-
Notifications
You must be signed in to change notification settings - Fork 0
/
Chap10.cpp
389 lines (372 loc) · 9.43 KB
/
Chap10.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
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
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
#include <memory>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
struct treeNode
{
int data;
treeNode* left;
treeNode* right;
};
treeNode* newTreeNode(int data)
{
treeNode* node = static_cast<treeNode*>(malloc(sizeof(treeNode)));
node->data = data;
node->left = NULL;
node->right = NULL;
return(node);
}
treeNode* GetBigTree()
{
treeNode *root = newTreeNode(314);
root->left = newTreeNode(6);
root->right = newTreeNode(6);
root->left->left = newTreeNode(271);
root->left->left->left = newTreeNode(28);
root->left->left->right = newTreeNode(0);
root->left->right = newTreeNode(561);
root->left->right->right = newTreeNode(3);
root->left->right->right->left = newTreeNode(17);
root->right->left = newTreeNode(2);
root->right->left->right = newTreeNode(1);
root->right->left->right->left = newTreeNode(401);
root->right->left->right->left->right = newTreeNode(641);
root->right->left->right->right = newTreeNode(257);
root->right->right = newTreeNode(271);
root->right->right->right = newTreeNode(28);
return root;
}
int getHeight(treeNode* root, bool &unbalanced)
{
if(unbalanced || !root)
return -1;
int heightL=0,heightR=0;
heightL=getHeight(root->left,unbalanced);
heightR=getHeight(root->right,unbalanced);
if(abs(heightL-heightR)>1)
{
unbalanced=true;
return -1;
}
else
return (1+std::max(heightL,heightR));
}
void Prob10(treeNode* root)
{
bool unbalanced=false;
getHeight(root,unbalanced);
if(unbalanced)
std::cout<<"Unbalanced tree";
else
std::cout<<"Balanced tree";
}
void BinSum(int& sum, int val, treeNode* root)
{
if (!root)
return;
val =val* 2 + (root->data);
if (!root->left && !root->right)
{
sum += val;
return;
}
BinSum(sum, val, root->left);
BinSum(sum, val, root->right);
}
void Prob10_6D()
{
treeNode *root = newTreeNode(1);
root->left = newTreeNode(0);
//root->right = newTreeNode(1);
root->left->left = newTreeNode(0);
root->left->right = newTreeNode(1);
root->left->right->right = newTreeNode(1);
root->left->right->right->left = newTreeNode(0);
root->left->left->left = newTreeNode(0);
root->left->left->right = newTreeNode(1);
int sum = 0, val = 0;
BinSum(sum, val, root);
std::cout << "Sum = " << sum << std::endl;
}
void Prob10_1D()
{
treeNode *root = newTreeNode(19);
root->left = newTreeNode(7);
root->right = newTreeNode(43);
root->left->left = newTreeNode(3);
root->left->right = newTreeNode(11);
root->right->left = newTreeNode(23);
root->right->left->right = newTreeNode(37);
root->right->left->right->left = newTreeNode(29);
root->right->left->right->left->right = newTreeNode(31);
root->right->left->right->right = newTreeNode(41);
root->right->right = newTreeNode(47);
root->right->right->right = newTreeNode(53);
Prob10(root);
treeNode *broot = newTreeNode(19);
broot->left = newTreeNode(7);
broot->right = newTreeNode(43);
broot->left->left = newTreeNode(3);
broot->left->right = newTreeNode(11);
broot->right->left = newTreeNode(23);
broot->right->right = newTreeNode(47);
broot->right->right->right = newTreeNode(53);
Prob10(broot);
}
bool IsSymm(treeNode *rootl, treeNode *rootr)
{
if(!rootl)
{
if(!rootr)
return true;
else
return false;
}
if(rootl->data!=rootr->data)
return false;
return (IsSymm(rootl->left,rootr->right)&&IsSymm(rootl->right,rootr->left));
}
void Prob10_3D()
{
treeNode *symmroot = newTreeNode(314);
symmroot->left = newTreeNode(6);
symmroot->right = newTreeNode(6);
symmroot->left->right = newTreeNode(2);
symmroot->left->right->right = newTreeNode(3);
symmroot->right->left = newTreeNode(2);
symmroot->right->left->left = newTreeNode(3);
if(IsSymm(symmroot,symmroot))
std::cout<<"symmetric\n";
else
std::cout<<"assymmetric\n";
treeNode *asymmroot = newTreeNode(314);
asymmroot->left = newTreeNode(6);
asymmroot->right = newTreeNode(6);
asymmroot->left->right = newTreeNode(2);
asymmroot->left->right->right = newTreeNode(9);
asymmroot->right->left = newTreeNode(2);
asymmroot->right->left->left = newTreeNode(8);
if(IsSymm(asymmroot,asymmroot))
std::cout<<"symmetric\n";
else
std::cout<<"assymmetric\n";
}
int FindInSubrange(const std::vector<int> &v, int s,int e,int elem)
{
int i=s;
while(i<=e && v[i]!=elem)
++i;
if(v[i]!=elem)
return -1;
else
return i;
}
treeNode* buildSubtreeFromPreIn(const std::vector<int> &pre,const std::vector<int> &in, int in_s, int in_e,int &pre_idx)
{
if(in_s>in_e || in_s<0 || in_e>in.size()-1||pre_idx>pre.size()-1)
return NULL;
treeNode *root=newTreeNode(pre[pre_idx]);
int root_idx=FindInSubrange(in,in_s,in_e,pre[pre_idx++]);
root->left=buildSubtreeFromPreIn(pre,in,in_s,root_idx-1,pre_idx);
root->right=buildSubtreeFromPreIn(pre,in,root_idx+1,in_e,pre_idx);
return root;
}
treeNode* buildSubtreeFromPreIn(std::string pre,std::string in,int &start)
{
treeNode* root=newTreeNode(pre[start]-'0');
int idx=in.find(pre[start],0);
start++;
root->left=(idx>0?buildSubtreeFromPreIn(pre,in.substr(0,idx),start):NULL);
root->right=(idx<in.size()-1?buildSubtreeFromPreIn(pre,in.substr(idx+1,std::string::npos),start):NULL);
return root;
}
void IOT(treeNode* root)
{
if (root==NULL)
return;
IOT(root->left);
std::cout<<root->data<<",";
IOT(root->right);
}
void Prob10_12D()
{
std::string in="621583497";
std::string pre="826513479";
int idx=0;
treeNode *root=buildSubtreeFromPreIn(pre,in,idx);
IOT(root);
std::vector<int> inV;std::vector<int> preV;
inV.push_back(6);inV.push_back(2);inV.push_back(1);inV.push_back(5);inV.push_back(8);inV.push_back(3);inV.push_back(4);inV.push_back(9);inV.push_back(7);
preV.push_back(8);preV.push_back(2);preV.push_back(6);preV.push_back(5);preV.push_back(1);preV.push_back(3);preV.push_back(4);preV.push_back(7);preV.push_back(9);
idx=0;
root=buildSubtreeFromPreIn(preV,inV,0,in.size()-1,idx);
std::cout<<"\n";
IOT(root);
}
void Prob10_10(treeNode* root)
{
std::stack<treeNode* > s;
s.push(root);
treeNode* t;
while(!s.empty())
{
t=s.top();s.pop();
std::cout<<t->data<<",";
if(t->right)
s.push(t->right);
if(t->left)
s.push(t->left);
}
}
void Prob10_10D()
{
treeNode *root = GetBigTree();
Prob10_10(root);
}
treeNode* Prob10_13(const std::vector<int> &v)
{
std::stack<treeNode*> s;
for(int i=v.size()-1;i>=0;--i)
{
if(v[i]!=-1)
{
treeNode* r=newTreeNode(v[i]);
r->left=s.top();s.pop();
r->right=s.top();s.pop();
s.push(r);
}
else
s.push(NULL);
}
return s.top();
}
void Prob10_13D()
{
std::vector<int> preV;
preV.push_back(8);preV.push_back(2);preV.push_back(6);preV.push_back(-1);preV.push_back(-1);preV.push_back(5);preV.push_back(1);preV.push_back(-1);preV.push_back(-1);preV.push_back(-1);
preV.push_back(3);preV.push_back(-1);preV.push_back(4);preV.push_back(-1);preV.push_back(7);preV.push_back(9);preV.push_back(-1);preV.push_back(-1);preV.push_back(-1);
treeNode* r=Prob10_13(preV);
IOT(r);
}
bool FindWeight(int sum, treeNode* root, int weight)
{
if (!root)
return false;
sum += root->data;
if (sum == weight && (!root->left && !root->right))
return true;
return(FindWeight(sum, root->left, weight) || FindWeight(sum, root->right, weight));
}
void Prob10_7D()
{
treeNode *root = GetBigTree();
int weight = 580;
if (FindWeight(0, root, weight))
std::cout << weight << " has been found\n";
else
std::cout << weight <<" has not been found\n";
}
void GetLeftAndRightExteriors(treeNode* l, treeNode* r, std::vector<treeNode*> &l_e, std::vector<treeNode*> &r_e)
{
if (!l && !r)
return;
if (l)
l_e.push_back(l);
if (r)
r_e.push_back(r);
GetLeftAndRightExteriors(l->left, r->right, l_e, r_e);
}
void GetLeaves(treeNode* root,std::vector<treeNode*> &v)
{
if (!root)
return;
if (!root->left && !root->right)
v.push_back(root);
else
{
GetLeaves(root->left, v);
GetLeaves(root->right, v);
}
}
std::vector<treeNode*> GetExterior(treeNode* root)
{
std::vector<treeNode*> l_e, r_e;
std::vector<treeNode*> leaves;
std::vector<treeNode*> result;
GetLeftAndRightExteriors(root->left, root->right, l_e, r_e);
GetLeaves(root, leaves);
result.push_back(root);
result.insert(result.end(),l_e.begin(), l_e.end()-1);
result.insert(result.end(), leaves.begin(), leaves.end());
std::reverse(r_e.begin(), r_e.end());
result.insert(result.end(), r_e.begin()+1, r_e.end());
return result;
}
void Prob10_15D()
{
treeNode* root = GetBigTree();
std::vector<treeNode*> result = GetExterior(root);
for (int i = 0; i < result.size(); ++i)
{
std::cout << (result[i]->data)<<",";
}
}
void NonRecursivePreOrderTraversal(treeNode *root)
{
if (!root)
return;
std::stack<treeNode*> s;
treeNode* current;
s.push(root);
while (!s.empty())
{
current = s.top();
s.pop();
std::cout << current->data << ",";
if (current->right)
s.push(current->right);
if (current->left)
s.push(current->left);
}
}
void NonRecursivePostOrderTraversal(treeNode *root)
{
if (!root)
return;
std::stack<treeNode*> s;
std::stack<treeNode*> final;
treeNode* current;
s.push(root);
while (!s.empty())
{
current = s.top();
s.pop();
final.push(current);
if (current->left)
s.push(current->left);
if (current->right)
s.push(current->right);
}
while (!final.empty())
{
current = final.top();
final.pop();
std::cout << current->data <<",";
}
}
void Prob10_9D()
{
treeNode *root = GetBigTree();
NonRecursivePreOrderTraversal(root);
std::cout << std::endl;
NonRecursivePostOrderTraversal(root);
}
int main(int argc, char** argv)
{
Prob10_15D();
getchar();
return 0;
}