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
| program derevo;
uses crt;
const
n = 11;
Type
pnode= ^node;
node = record
v : integer;
right, left : pnode;
lf, rf : boolean;
end;
var
root : pnode;
st : boolean;
v : integer;
right, left : pnode;
j, h, i, answ, answ2 : integer;
m : array[1..n] of integer;
procedure Insert(var root: pnode; X: integer);
procedure CreateNode(var p : pnode; n : integer);
begin
new(p);
p^.v := n;
p^.left := nil;
p^.right := nil;
end;
begin
if root = nil then
CreateNode(root, X)
else
with root^ do
begin
if v < X then
Insert(right, X)
else
if v > X then
Insert(left, X)
else
begin
writeln('Такой элемент уже есть');
exit;
end;
end;
end;
procedure ViewTree(root : pnode);
var
mas1, mas2 : array[1..11] of integer;
q, m1, m2 : integer;
Sch, Chl, Chr : pnode;
function sc(s : integer) : integer;
var c, c1, w : integer;
begin
c := 0;
sc := 0;
s := s-1;
if s = 0 then
exit;
for w := 1 to s do
begin
c1 := 1+2*c;
c := c1;
end;
sc := c1;
end;
procedure Search(root : pnode; s : integer);
begin
if root^.v = s then
begin
Sch := root;
exit;
end;
if root = nil then
exit
else
begin
Search(root^.right, s);
Search(root^.left, s);
end;
end;
procedure ToMas2;
begin
if Sch^.left <> nil then
begin
Chl := Sch^.left;
m2 := m2+1;
mas2[m2] := Chl^.v;
end
else
begin
m2 := m2+1;
mas2[m2] := 0;
end;
if Sch^.right <> nil then
begin
Chr := Sch^.right;
m2 := m2+1;
mas2[m2] := Chr^.v;
end
else
begin
m2 := m2+1;
mas2[m2] := 0;
end;
end;
procedure ToMas1;
begin
if Sch^.left <> nil then
begin
Chl := Sch^.left;
m1 := m1+1;
mas1[m1] := Chl^.v;
end
else
begin
m1 := m1+1;
mas1[m1] := 0;
end;
if Sch^.right <> nil then
begin
Chr := Sch^.right;
m1 := m1+1;
mas1[m1] := Chr^.v;
end
else
begin
m1 := m1+1;
mas1[m1] := 0;
end;
end;
procedure NilToMas1;
begin
if i > 1 then
begin
m1 := m1+1;
mas1[m1] := 0;
m1 := m1+1;
mas1[m1] := 0;
end;
end;
procedure NilToMas2;
begin
if i > 1 then
begin
m2 := m2+1;
mas2[m2] := 0;
m2 := m2+1;
mas2[m2] := 0;
end;
end;
begin
mas1[1] := root^.v;
m1 := 1;
m2 := 9;
for i := h downto 1 do
begin
writeln;
if mas1[1] = 0 then
begin
NilToMas2;
write('':(sc(i)+1));
end
else
begin
write('':sc(i), mas1[1]);
Search(root, mas1[1]);
ToMas2;
end;
if m1 > 1 then
begin
for q := 2 to m1 do
if mas1[q] = 0 then
begin
NilToMas2;
write('':(sc(i+1)+1));
end
else
begin
write('':sc(i+1), mas1[q]);
Search(root, mas1[q]);
ToMas2;
end;
end;
m1 := 0;
if i = 1 then
break
else
i := i-1;
writeln;
if mas2[1] = 0 then
begin
NilToMas1;
write('':(sc(i)+1));
end
else
begin
write('':sc(i), mas2[1]);
Search(root, mas2[1]);
ToMas1;
end;
for q := 2 to m2 do
begin
if mas2[q] = 0 then
begin
NilToMas1;
write('':(sc(i+1)+1));
end
else
begin
write('':sc(i+1), mas2[q]);
Search(root, mas2[q]);
ToMas1;
end;
end;
m2 := 0;
end;end;
procedure PrintDown(level : integer; root : pnode);
begin
if root = nil then
exit;
with root^ do
begin
if right = nil then
rf := false;
lf := false;
if (left = nil) and (right = nil) then
begin
j := j+1;
if h < j then
h := j;
j := 0;
end;
writeln('':2*level, v);
j := j+1;
PrintDown(level+1, left);
PrintDown(level+1, right)
end;end;
procedure PrintLex(level : integer; root : pnode);
begin
if root = nil then
exit;
with root^ do
begin
PrintLex(level+1, left);
writeln('':2*level, v);
PrintLex(level+1, right);
end; end;
procedure PrintUp(level : integer; root : pnode);
begin
if root = nil then
exit;
with root^ do
begin
PrintUp(level+1, left);
PrintUp(level+1, right);
writeln('':2*level, v);
end; end;
procedure Threading(x : pnode);
var
p : pnode;
stop : boolean;
procedure rightPointer(y : pnode; i : integer);
begin
if stop = true then
exit;
j := j+1;
if y = nil then
exit;
with y^ do
begin
rightPointer(left, i);
if (j > i) and (rf = true) then
begin
j := 0;
writeln('Прошиваем ', x^.v, ' элемент с ', v);
x^.right := y;
stop := true;
x^.lf := true;
exit;
end;
if lf = true then
exit;
rightPointer(right, i);
end ;
end;
begin
i:= i+1;
if x = nil then
exit;
with x^ do
begin
rf := true;
Threading(left);
if (rf = true) and (right = nil) then
begin
stop := false;
rightPointer(root, i);
end;
if (left = nil) and (right = nil) then
begin
stop := false;
rightPointer(root, i);
end;
writeln(' ',v);
if lf = true then
exit;
Threading(right);
end;end;
procedure Cycle;
begin
for i := 1 to n do
Insert(root, m[i]);
end;
begin
clrscr;
m[1]:=1;
m[2]:=1;
m[3]:=1;
m[4]:=1;
m[5]:=1;
m[6]:=1;
m[7]:=1;
m[8]:=1;
m[9]:=1;
m[10]:=1;
m[11]:=1;
Cycle;
PrintDown(1, root);
writeln('Выберите действие');
repeat
writeln('1 - провести обход, 2 - отобразить дерево, 3 - выполнить прошивку, 4 - выход');
readln(answ);
case (answ) of
1 :
begin
if st = true then
writeln('Обход невозможен - дерево прошито')
else
begin
writeln('Выберите обход: 1 - сверху-вниз, 2 - слева-направо, 3 - снизу-вверх');
readln(answ2);
case (answ2) of
1 :
begin
writeln('Обход сверху-вниз:');
PrintDown(1, root);
end;
2 :
begin
writeln('Обход слева-направо:');
PrintLex(1, root);
end;
3 :
begin
writeln('Обход снизу-вверх:');
PrintUp(1, root);
end;
end;
end;
end;
2 :
begin
if st = true then
writeln('Дерево прошито - его представление невозможно')
else
begin
writeln('Представление дерева:');
ViewTree(root);
end;
end;
3 :
begin
if st = true then
writeln('Дерево уже прошито')
else
begin
writeln('Прошивка:');
i := 0;
j := 0;
Threading(root);
st := true;
end;
end;
4 : exit;
end
until answ=4
end. |