-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedqueue.c
90 lines (81 loc) · 1.38 KB
/
linkedqueue.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <stdio.h>
#include <stdlib.h>
struct queue
{
int data;
struct queue *next;
};
typedef struct queue node;
node *ptr,*newnode,*ptr,*rear,*front,*temp;
int ele =0;
int rval;
void create()
{
newnode=(node*)malloc(sizeof(newnode));
newnode->data=ele;
newnode->next=NULL;
}
void enqueue()
{
printf("enter the element to push");
scanf("%d",&ele);
create(ele);
if(rear==NULL)
{
rear=newnode;
front=newnode;
}
else
{
rear->next=newnode;
rear=newnode;
}
}
int dequeue()
{
if(front==NULL)
{
printf("QUEUE IS EMPTY\n");
return 0;
}
else
{
temp=front;
front=temp->next;
rval=temp->data;
free(temp);
printf("the dequeued element %d",rval);
return 0;
}
}
void display()
{
ptr=front;
while(ptr!=NULL)
{
printf("%d\n",ptr->data);
ptr=ptr->next;
}
}
int main()
{
int ch;
while(1)
{
printf("1.enqueue\n2.dequeue\n3.DISPLAY\n4.exit");
printf("ENTER CH");
scanf("%d",&ch);
switch(ch)
{
case 1:enqueue();
break;
case 2:dequeue();
break;
case 3:display();
break;
case 4:exit(0);
break;
}
}
return 0;
}