
Linear Data Structure 495
int r=6,f*0,n;
clrscr () ;
printf (" In itia l values rear-%d front-% d*,r,f) j
printf ("\n How many elements u want to delete : ”);
scanf ("%d”,6n);
while (f<n)
{
queue[f] «NULL;
f++;
printf ( ”\nrear«%d front-% d",r,f) j
}
printf (”\n Queue elements are : ”);
for ( n«0?n<7;n++)
printf (■ %d ”,queue[n]);
OUTPUT;
Initial values rear=6 front=*0
How many elements u want to delete: 3
rear=6 front=l
rear=6 front=2
rear=6 front=3
Queue elements are: 0 0 0 4 5 6 7
Explanation The above program is the second part of the first program. We have started exactly
from where we ended the last program. Th ...