8/18/2019 sorce code struktur data

1/2

Type Node=record

info:Integer;

parent:integer;

left:integer;

right:integer;

end;

Type Tree=Record

Root:^Node;

arNode:Tlist;

end;

Var T:Tree;

Untuk Tlist

Procedure TFor !"#isip$#T%&&';

Var $( ) : integer;

n( pn( p*:^Node;

$egin

T"root:=nil++pohon kosong

++a *il data input

For $:=, to sgNode"Ro-.ount/! do

$egin

0:=strtoint%sgNode".ells1!($2';

++$uat ele en *aru

Ne-%p*';

p*^"info:=);

p*^"parent:=nil;

p*^"left:=nil;

p*^"right:=nil;

T"arNode"3dd%p*';

n:=T"root; ++cari dari root

If n=nil then ++pohon kosong

$egin

T"root:=p*; ++node *aru se*agai root

4nd

4lse

*egin

5hile %n67nil' do

$egin

If %06n^"info' then

8/18/2019 sorce code struktur data

2/2

$egin

pn:=n;

n:= n^" left;

4nd

4lse if %07 n^"info' then

$egin

pn:=n;

n:= n^"right;

4nd;

4nd;

If 06pn^" info then

$egin++sisipkan se*gai anak kiri

pn^" left:=p;

pn^" parent:=pn;

4nd

4lse

$egin++sisipkan se*gai anak kanan

pn^"right:=p;

pn^" parent:=pn;

4nd ;

4nd;++else

4nd;++for