cpp-data-structures/queue-using-linked-list.cpp at main · gkumar9891/cpp-data-structures · 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
#include<iostream>
usingnamespacestd;

classQueue {
public:
int data;
 Queue* next = NULL;

Queue(int input) {
 data = input;
 }
};

voidenqueue(Queue* &front, Queue* &back, int data) {
 Queue* n = newQueue(data);

if(front == NULL) {
 front = back = n;
return;
 }
 back->next = n;
 back = n->next;
}

voiddequeue(Queue* &front) {
 front = front->next;
}

voidpeek(Queue* front) {
 cout << front->data;
}

boolempty(Queue* front) {
if(front == NULL) {
 cout << true;
returntrue;
 }
 cout << false;
returnfalse;
}


intmain() {

 Queue* front = NULL;
 Queue* back = NULL;

enqueue(front, back, 1);
enqueue(front, back, 2);
dequeue(front);
empty(front);
 cout << endl;
peek(front);


return0;

}