11bintre.pas

关于课件 好多种结构的算法 等等 大家自己看吧

program crightbtree(input,output);
TYPE
  datype=integer; 
  point= ^node;
  node=record
    data:datype;
    left,right:point
  end;
var
 x:datype;
 root:point;
procedure inorder(p:point);
begin
  if p<>nil then
  begin
   inorder(p^.left);
   write(p^.data:3);
   inorder(p^.right);
  end;
end;
procedure add(x:integer;VAR p:point);
begin
 if p=nil then
  begin
   new(p);
   with p^ do
    begin
     data:=x;
     left:=nil;
     right:=nil;
    end;
  end
 else
  with p^ do
   if x<data then add(x,left)
   else add(x,right);
 end;
begin
 root:=nil;
 read(x);
 while not eof do
  begin
   add(x,root);
   read(x);
  end;
 writeln;
 inorder(root);
end.