DataStructures/Queue_operations.c at main · PawanKalyanV/DataStructures · GitHub

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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

/* queue operations such as insert delete traverse */

#include<stdio.h>
#include<stdlib.h>

#define CAPACITY 5

int queue[CAPACITY];
int front=0;
int rear=0;
int ele;
void insert(int);
void delete();
void traverse();

void main()
{
	int ch;

	while(1)
          {

        	printf("\n1.insert\n");
		printf("2.delete\n");
		printf("3.traverse\n");

		printf("Enter the choice:");
		scanf("%d",&ch);


	    switch(ch)
		{

                  case 1:
			printf("\nEnter the element:");
			scanf("%d",&ele);
			insert(ele);
			break;

                  case 2:
			delete();
			break;

                  case 3:
			traverse();
			break;

		  default:exit(0);

		}
	   }

}

void insert(int ele)
{
	if(CAPACITY == rear)
	   {

	       printf("\nThe queue is full");
	   }
	else
	   {
		int ele;

		queue[rear] = ele;

		rear++;

	   }

}


void delete()
{

	if(front == rear)
	   {

                printf("\nThe queue is empity\n");

	   }
	else
	   {

		printf("\nElement deleted in queue %d\n", queue[front]);

		for(int i=0; i<rear-1; i++){

		queue[i] = queue[i+1];

		}
		rear--;
	   }
}

void traverse()
{
	if(front == rear)
	{

         printf("\nThe queue is empity\n");

	}
	else
	{
		printf("\nElements in queue\n");

		for(int i=front; i<rear; i++){

			printf("%d\n",queue[i]);
		}
	}

}