тсмйжхъ онхяйю

function find(t : tree; x : longint) : boolean;
begin
    if Tree=nil then find := false
                else if t^.inf=x then Find := True
                                    else if x < t^.inf
                                         then Find := Find(t^.L, x)
                                         else Find := Find(t^.R, x)
end;



нямнбмюъ опнцпюллю 

program derevo;
uses crt,opisanie,treeunit,printtreed;
begin
randomize;
clrscr;
for i:=1 to 15 do
 begin
  l:=random(12)+1;
  CreateDerevo(bderevo,l);
 end;
PrintTree(bderevo,2);
writeln;
writeln;
readln;
end.


лндскэ онярпнемхъ депебю

unit TreeUnit; {treeunit.tpu}

interface

uses opisanie;
procedure CreateDerevo(var t:tree;x:longint);

implementation

procedure CreateDerevo;
begin
 if t=nil then begin
                  new(t);
                  t^.l:=nil;
                  t^.R:=nil;
                  t^.inf:=x;
                  end
             ELSE if x<t^.inf then CreateDerevo(t^.l,x)
                                 else CreateDerevo(t^.r,x)
end;



end.{treeunit.tpu}





лндскэ оевюрх депебю

unit printTreed; {printtree.tpu}

interface

uses opisanie;
procedure PrintTree(var t:tree;n:longint);

implementation

procedure PrintTree;
var i:integer;
begin
 if t<>nil then begin
                  PrintTree(t^.r,n+1);
                  for i:=1 to n do
                  write(' ');
                  writeln(t^.inf);
                  PrintTree(t^.l,n+1);
                end;
end;



end.{printtree.tpu}





бяонлнцюрекэмши лндскЭ

unit opisanie; {opisanie.pas}
 interface
 const k=7;
 type
     tree=^bintree;
     bintree=Record
             inf:longint;
             L,R:tree
             end;
var bderevo:tree;
    i,l:byte;
 implementation
end.  {opisanie.pas}