-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathQueue.cpp
More file actions
73 lines (63 loc) · 804 Bytes
/
Copy pathQueue.cpp
File metadata and controls
73 lines (63 loc) · 804 Bytes
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
// Queue
#include <iostream>
using namespace std;
class Node
{
public:
int data;
Node* next;
Node(int d):data(d),next(NULL){};
};
class Queue
{
public:
Node* head;
Node* tail;
Queue(){
head = tail = NULL;
}
void push(int d){
if(head==NULL){
Node* n = new Node(d);
head = tail = n;
}
else{
Node* n = new Node(d);
tail->next = n;
tail = n;
}
}
void pop(){
if(head==NULL){
return;
}
else if(head->next == NULL){
delete head;
head = tail = NULL;
}
else{
Node* temp = head;
delete temp;
head = head->next;
}
}
int front(){
return head->data;
}
bool empty(){
return head==NULL;
}
};
int main()
{
Queue q;
q.push(1);
q.push(2);
q.push(3);
q.push(4);
while(!q.empty()){
cout<<q.front()<<endl;
q.pop();
}
return 0;
}