Maximum in Queue by type linked lst by R4R Team


program-

#include< stdio.h>
#include< conio.h>
#include< alloc.h>
struct node
{
int data;
struct node *next;
};
struct node *front=NULL,*rear=NULL;
void create()
{
struct node *ptr,*cpt;
char ch;
printf("Enter item\n");
ptr=(struct node*)malloc(sizeof(struct node));
scanf("%d",&ptr->data);
front=ptr;
do
{
cpt=(struct node*)malloc(sizeof(struct node));
printf("Enter item\n");
scanf("%d",&cpt->data);
ptr->next=cpt;
ptr=cpt;
printf("Continue(y/n)?");
ch=getch();
}while(ch=='y');
ptr->next=NULL;
rear=ptr;
}

void display()
{
struct node *ptr;
ptr=front;
printf("Queue is : n");
while(ptr!=NULL)
{
printf("%d ",ptr->data);
ptr=ptr->next;
}
}

void maximum()
{
struct node *ptr=front;
int max=front->data;
while(ptr!=NULL)
{
if(ptr->data>max)
max=ptr->data;
ptr=ptr->next;
}
printf("Maximum in queue is %d",max);
}

void main()
{
clrscr();
create();
display();
maximum();
getch();
}

output-

Enter item
9
Enter item
5
Continue(y/n)?
Enter item
1
Continue(y/n)?
Enter item
6
Continue(y/n)?
Enter item
8
Continue(y/n)?
Queue is :
9 5 1 6 8
Maximum in queue is 9

-In this program, we have three function create() and traverse(),maximum().
- create() : is used to create a queue using linked list.
- display() : is used to traverse the queue from front to rear.
- maximum() : is used to find the maximum element in queue.




Leave a Comment:
Search
Categories
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!