-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathimplementQueue.cpp
More file actions
73 lines (60 loc) · 1.37 KB
/
Copy pathimplementQueue.cpp
File metadata and controls
73 lines (60 loc) · 1.37 KB
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
// implementaion of queue
#include<iostream>
#include<queue>
using namespace std;
class Queue {
int* arr;
int qfront;
int rear;
int size;
public:
Queue() {
size = 1000001;
arr = new int[size];
qfront = 0; // initally dono zero pe hi hoge bro rear aur front
rear = 0;
}
// public functions of queue
bool isEmpty() {
if(qfront == rear) { // agar empty hai toh front aur rear dono bhi zero pe hi rhenge n bro
return true; // true empty
}
else
{
return false; // nhi empty hai isley false
}
}
void enqueue(int data) {
if(rear == size)
cout << "Queue is Full" << endl;
else
{
arr[rear] = data;
rear++;
}
}
int dequeue() {
if(qfront == rear) {
return -1;
}
else
{ int ans = arr[qfront];
arr[qfront] = -1;
qfront++;
if(qfront==rear){
qfront = 0;
rear = 0;
}
return ans;
}
}
int front() {
if(qfront == rear) {
return -1;
}
else
{
return arr[qfront];
}
}
};