DataStructures-and-Algorithims/queueoperations.cpp at main · shivam228/DataStructures-and-Algorithims · 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
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int max1=100;
int front = -1;
int queue1[100];
int rear =-1;

void push(int x)
{
	if(rear == max1-1)
	cout<<"queue full";
	else
	{
	if(rear==-1)
	{
		rear++;
		front++;
		queue1[rear] = x;
	}
	else
	{
	rear++;
	queue1[rear] = x;
}
}
}
void pop()
{
	if(front == -1)
	cout<<"queue underflow"<<endl;
	else
	{
		if(front == rear)
		{
		int ele = queue1[front];
		cout<<"element popped"<<" "<<ele<<endl;
		front=-1;
		rear= -1;
	    }
	else
	{
		int ele1 = queue1[front];
		cout<<"element popped"<<" "<<ele1<<endl;
		front = front+1;
	}
	}

}

int main()
{
	push(40);
	push(20);//push represents enqueue operation
	push(30);
	push(10);
	pop();//pop represents dequeue operation
	pop();
	pop();
	pop();
	pop();
	push(60);
	push(25);
	for(int i = front;i<=rear;i++)
	cout<<queue1[i]<<" ";
}