Бинарное дерево!! )

Program Lab_10;
Uses Crt;
 
type
tabl=record
     surname:string[15];
     name:string[15];
     secsurname:string[15];
     mat,fiz,his:integer;
     end;
 
TreePtr=^tree;
 
Tree=record
    data:tabl;
    left,right:TreePtr;
    end;
 
var
top:TreePtr;
z:tabl;
level,n,i,number:integer;
newnode:string[15];
b:boolean;
 
function addtree(top:treeptr; newnode:tabl):treeptr;
begin
if top=nil then
 begin
  new(top);
  top^.data:=newnode;
  top^.left:=nil;
  top^.right:=nil;
 end
else
 if top^.data.surname>newnode.surname then
  top^.left:=addtree(top^.left,newnode)
 else
  top^.right:=addtree(top^.right,newnode);
 Addtree:=top;
end;
 
Procedure Org_Tree;
begin
Writeln('vipolnyaetsa procedura organizacii dereva');
top:=nil;
while true do
 begin
  writeln('vvedite familiyu ili * dlyz vihoda');
  readln(z.surname);  if z.surname='*' then Exit;
  writeln('vvedite imya');
  readln(z.name);
  writeln('vvedite otchestvo');
  readln(z.secsurname);
  writeln('vvedite ocenky po matematike');
  readln(z.mat);
  writeln('vvedite ocenky po fizike');
  readln(z.fiz);
  writeln('vvedite ocenky po istorii');
  readln(z.his);
  top:=addtree(top,z);
 end;
end;
 
Procedure Dob_l;
begin
Writeln('vipolnyaetsya procedura dobavleniya lista');
writeln('vvedite familiyu ili * dlyz vihoda');
  readln(z.surname);
  writeln('vvedite imya');
  readln(z.name);
  writeln('vvedite otchestvo');
  readln(z.secsurname);
  writeln('vvedite ocenky po matematike');
  readln(z.mat);
  writeln('vvedite ocenky po fizike');
  readln(z.fiz);
  writeln('vvedite ocenky po istorii');
  readln(z.his);
  if z.surname='*' then Exit;
  top:=addtree(top,z);
 end;
 
Procedure Prosmotr (top:treeptr);
begin
if top<>nil then
 begin
  prosmotr(top^.left);
  writeln(i,' ',top^.data.surname,' ',top^.data.name,' ',top^.data.secsurname,
  ' ',top^.data.mat,' ',top^.data.fiz,' ',top^.data.his);
  Inc(i);
  Prosmotr(Top^.right);
 end;
end;
 
Procedure Lr(top:TreePtr);
begin
if top<>nil
then
 begin
  Lr(top^.left);
  Writeln(top^.data.surname);
  Lr(top^.right);
 end;
end;
 
Procedure Otobr(top:TreePtr; Otstup:Integer);
Begin
 if top<>nil then
  begin
   otstup:=otstup+3;
   otobr(top^.right,otstup);
   writeln(' ':otstup,top^.data.surname);
   otobr(top^.left,otstup);
  end;
end;
 
{function step2 (n:integer):integer;
var
i,p:integer;
begin
p:=2;
for i:=1 to n do
p:=p*i;
step2:=p;
end;
 
 
Procedure Poisk_level(top:treeptr; newnode:string; var level:integer; var b:boolean);
var
q:integer; {num vershina}
{begin
q:=0;
level:=1;
b:=false;
while (top<>nil) and (not b) do
 begin
 q:=q+1;
 if q=step2(level)-1
 then Inc(level);
 if top^.data.surname=newnode then
  b:=true
 else
  if top^.data.surname>newnode then
  top:=top^.left
 else
  top:=top^.right;
 end;
end;}
 
Procedure LL (top:treeptr);
var
q:string[15];
begin
if top <>nil then
 begin
  LL(top^.left);
  q:=top^.data.surname;
 end;
Writeln('q=',q);
end;
 
 
 
Procedure Poisk_level(Temp:TreePtr; var i:integer; newnode:string; var b:boolean );
begin
Temp:=top;
i:=0;
b:=false;
while (top<>nil) and not b do
 begin
  Inc(i);
  if top^.data.surname=newnode then
  begin
  b:=true;
  Exit;
  end
 else
  if top^.data.surname>newnode then
  top:=top^.left
 else
  top:=top^.right;
 end;
 
 end;
 
 
 
 
 
 
 
 
 
 
Begin
While true do
begin
 ClrScr;
 Writeln('1-organizaciya dereve');
 Writeln('2-dobavlenie lista');
 Writeln('3-prosmotr dereva');
 Writeln('4-obhod dereva');
 Writeln('5-poisk level');
 Writeln('6-poisk left rek');
 Writeln('7-vihod');
 
 Writeln('Vvedite punkt menu');
 Readln(number);
 Case number of
 1:Org_Tree;
 2:Dob_l;
 3:begin
    Writeln('derevo');
    i:=0;
    Prosmotr(top);
    Otobr(top,1);
    Writeln('nagmite enter');
    Readkey;
   end;
 4:Lr(top);
 5:begin
   writeln('vvesti kluch');
   readln(newnode);
   poisk_level(top,level,newnode,b);
   if b=false
   then writeln('takogo klucha net')
   else
    writeln('level=',level);
    readkey;
   end;
 6:begin
 LL(top);
 readkey;
   end;
 7:Exit;
end;
end;
end.
 
 
end.