Heap Implementation Using Priority Queues c program

Data Structures using C Language / Heap Implementation Using Priority Queues c program

Program

#include<stdio.h>
#include<malloc.h>
void insert(); void delete(); void display();

struct node
{
int priority;
int info;
struct node *next;
}*start=NULL,*q,*temp,*new;
typedef struct node N;

void main()
{
int ch;
clrscr();
do
{
printf("\n 1. Insertion  \t    2. Deletion\t   3. Display  4. Exit \t:");
scanf("%d",&ch);
switch(ch)
{
case 1:insert();break;
case 2:delete();break;
case 3:display();break;
case 4:break;
}
}
while(ch<4);
}
 
void insert()
{
int element,elementpriority;
new=(N*)malloc(sizeof(N));
printf("Enter the element to be inserted:\t");
scanf("%d",&element);
printf("Enter Its Priority :\t");
scanf("%d",&elementpriority);
new->info=element;
new->priority=elementpriority;
new->next=NULL;
if(start==NULL )
{
//new->next=start;
start=new;
}
else if(start!=NULL&&elementpriority<=start->priority)
{  new->next=start;
start=new;
}
else
{
q=start;
while(q->next != NULL && q->next->priority<=elementpriority)
{q=q->next;}
new->next=q->next;
q->next=new;
}
}
 
void delete()
{
if(start==NULL)
printf("\n Queue Underflow\n"); 
 else
{
new=start;
printf("\nDeleted element IS %d\n",new->info);
start=start->next;
//free(start);
}
}
void display()
{
temp=start;
if(start==NULL)
printf("Queue Is Empty\n");
else
{
printf("QUEUE IS:\n");
if(temp!=NULL)
for(temp=start;temp!=NULL;temp=temp->next)
{
printf("\n%d priority =%d\n",temp->info,temp->priority);
//temp=temp->next;
}
}
}

Output

1. Insertion    2. Deletion   3. Display 4. Exit: 1
Enter the element to be inserted: 9
Enter Its Priority: 6
1. Insertion    2. Deletion   3. Display 4. Exit: 1
Enter the element to be inserted: 6
Enter Its Priority: 2
1. Insertion    2. Deletion   3. Display 4. Exit: 3

6 Priority =2
9 Priority =6

Home Back