Category : Pascal Source Code
Archive   : T-SORTS.ZIP
Filename : QUEUE.PAS

Program Queue(input,output);


{ Queue program by Chris Gorman of 2AM Associates.
If you have comments of questions you can reach Chris at the original
2AM-BBS, the DREW UNIVERSITY UNDERGROUND. (201)-377-8245 }


Type nodeptr=^node;
node=record
data:integer;
next:nodeptr;
end;

Var queue:nodeptr;
i,x:integer;

Procedure push(Var Q:nodeptr;x:integer);
Var P,s:nodeptr;
begin
new(p);
p^.data:=x;
P^.next:=nil;
s:=Q;
If (q=nil) {empty queue} then Q:=p else begin
While (s^.next<>nil) do s:=s^.next;
s^.next:=p;
end;
end;


Function pop(Var q:nodeptr):integer;
Var s:nodeptr;
begin
s:=q;
pop:=q^.data;
q:=q^.next;
dispose(s);
end;

begin
Queue:=nil;
For i:=1 to 4 do begin
writeln('enter number');
readln(x);
push(queue,x);
end;
For I:=1 to 4 do writeln(pop(queue));
end.