11delnod.pas

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

program delnod(input,output);
TYPE
  datype=integer; 
  point= ^node;
  node=record
    data:datype;
    link:point
  end;
var
 head:point;
 x:datype;
 deleted:boolean;
procedure scan(head:point);
VAR 
    x:datype;
    p:point; 
begin
  p:=head;
  writeln;
  while p<>nil do
  begin
   x:=p^.data;
   write(x:4);
   p:=p^.link;
  end; 
  writeln;
end;
procedure crtfifo(VAR head:point);
var 
 x:datype;
 last,next:point;
begin
 read(x);
 new(head);
 head^.data:=x;
 last:=head;
 read(x);
 while x>0 do
  begin
   new(next);
   next^.data:=x;
   last^.link:=next;
   last:=next;
   read(x);
  end;
 last^.link:=nil;
end;
procedure delnode(VAR head:point;x:datype;var daleted:boolean);
var
 last,next:point;
begin
 next:=head;
 while (next^.data<>x) and (next^.link<>nil) do
  begin
   last:=next;
   next:=next^.link;
  end;
 if next^.data=x then
  begin
   deleted:=true;
   if next=head then head:=head^.link
   else last^.link:=next^.link;
  end
 else deleted:=false;
end;
begin
 crtfifo(head);
 scan(head);
 {while not eof do
  begin
 }
   write('input value to be deleted: ');
   readln(x);
   delnode(head,x,deleted);
   scan(head);
   writeln(deleted);
  {end;}
end.