forked from bgopesh/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.cpp
More file actions
64 lines (51 loc) · 1.03 KB
/
queue.cpp
File metadata and controls
64 lines (51 loc) · 1.03 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
struct Queue
{
int data;
struct Queue *next;
};
struct Queue * frontnode =nullptr;
struct Queue * backnode =nullptr;
void enqueue(int data)
{
struct Queue *node = new Queue();
if(frontnode ==nullptr && backnode == nullptr)
{
node->data = data;
frontnode = node;
backnode = node;
return;
}
else
{
node->data = data;
backnode->next = node;
backnode = node;
}
}
void dequeue()
{
if(frontnode == nullptr && backnode == nullptr)
{
cout << "queue empty" << endl;
return;
}
Queue *tmp = frontnode;
frontnode =frontnode->next;
delete tmp;
cout << "dequeued" << endl;
}
int main()
{
enqueue(10);
enqueue(20);
enqueue(30);
enqueue(40);
enqueue(50);
cout << "front-->" << frontnode->data <<endl;
cout << "back-->" << backnode->data <<endl;
dequeue();
dequeue();
cout << "front-->" << frontnode->data <<endl;
cout << "back-->" << backnode->data <<endl;
return 0;
}