Binární Strom

program BinTree;
type tData=integer;
type ukPrvek=^tree;
     tree = record
          data:tData;
          left:ukPrvek;
          right:ukPrvek;
     end;

var root:ukPrvek;                                   {koren stromu}
    data:tData;

procedure insert(x:tData;var pom:ukPrvek);
begin
     if pom=nil then
     begin
          new(pom);
          with pom^ do begin
               data := x;
               left := nil;
               right := nil
          end;
      end
      else with pom^ do
           if x < data then insert(x, left)
           else insert(x, right);
end;

procedure vypis(pom: ukPrvek);
begin
  if pom <> nil then begin
     with pom^ do begin
       vypis(left);
       writeln(data);
       vypis(right);
     end;
   end;
end;

procedure init;
begin
     root:=nil;
end;

begin
init;
data:=1;
while data <> 0 do
begin
     read(data);
     insert(data, root);
     writeln('Hodnota vlozena..');
end;
writeln;
vypis(root);
readln;
readln;
end.