Pascal News
Pascal News
Pascal News
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Ul<br />
U2<br />
lY3<br />
U4<br />
185<br />
186<br />
187<br />
188<br />
189<br />
190<br />
191<br />
192<br />
193<br />
194<br />
195<br />
196<br />
197<br />
198<br />
199<br />
200<br />
201<br />
202<br />
203<br />
204<br />
205<br />
206<br />
207<br />
208<br />
209<br />
210<br />
211<br />
212<br />
213<br />
214<br />
215<br />
216<br />
211<br />
218<br />
219<br />
220<br />
.. 221<br />
',. 222<br />
223<br />
224<br />
225<br />
226<br />
227<br />
228<br />
229<br />
230<br />
231<br />
232<br />
233<br />
234<br />
235<br />
2J6<br />
237<br />
238<br />
219<br />
240<br />
BEGIN ("AKE..NEW.CHARS)<br />
trees. t-num := 01<br />
REPEAT<br />
qet.2.mlns(posl, pos2, trl, tr2)J<br />
IF trl AND tr2<br />
THEN<br />
WITH trees DO<br />
BEGIN<br />
IF pos2 < posl<br />
ne"(temp):<br />
THEN<br />
-/<br />
exchan!ie(posl, poS2l~,<br />
,<br />
tempft .• SUIII := trs [posl) ft. sum + trs[p9s2t~, sum'<br />
temp·~ left := trs[posll:<br />
temp .... rIght := trs [poS21; trs[posll := temPJ<br />
t.num := t.num • I:<br />
FOR count := pos2 TO t.num DO<br />
trs[countl := trslcount .. II<br />
END<br />
EI.SE<br />
IF NOT trl AND NOT tr2<br />
THEN<br />
WIT!! trees DO<br />
BEGIN<br />
t.nlllll := t~num + 11 new(trs It.num]);<br />
NI-fH trs (t.numl ft DO<br />
BEGIN<br />
sum := tallylpostJ. nURl.of .. t'ally[pos21.<br />
num_ofl<br />
new(left): new(riqht):<br />
groundCleft, post): ground(right, pos2)<br />
END<br />
END<br />
EI.SE<br />
WITH trees DO<br />
BEGIN<br />
IF tr2 THEN e~ch8nge(post, pos2)1<br />
new(temp}J<br />
tellpft .• SURI :_ trs [pasO ft. sum + tally Ipos21.<br />
nUIR..ot;<br />
tellp~. left := trs[poslJ: newCtemp-. right),<br />
'1roun