sumQueue.cpp
This is from the practice midterm.
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include <iostream>
using namespace std;
class Queue{
private:
public:
struct node{
int data;
node* next;
};
node* head = nullptr;
node* current = nullptr;
Queue(){
}
Queue(int a){
enqueue(a);
}
void enqueue(int a){
node* tmp = nullptr;
if (head == nullptr){
head = new node{a, nullptr};
current = head;
}
else {
tmp = new node{a, nullptr};
current -> next = tmp;
current = current -> next;
}
}
bool dequeue(){
if (head == nullptr){
return false;
}
node* prev = nullptr;
for (node* i = head; i != nullptr; i = i -> next){
if (i -> next == nullptr){
prev -> next = nullptr;
delete i;
return true;
}
prev = i;
}
}
node* front(){
return head;
}
int size(){
node* i = head;
int count = 0;
while (i != nullptr){
count++;
i = i -> next;
}
return count;
}
void print(){
node* i = head;
cout << "Queue Elements: ";
while(i != nullptr){
cout << i -> data << " ";
i = i -> next;
}
cout << endl;
}
};
int sum(const Queue& q){
Queue::node* i = q.head;
int sum = 0;
while (i != nullptr){
sum += i -> data;
i = i -> next;
}
return sum;
}
int main(){
Queue q1;
q1.enqueue(2);
q1.enqueue(5);
q1.enqueue(2);
q1.enqueue(1);
cout << "Suppose Q contains these elements " << endl;
q1.print();
cout << "Sum together " << endl;
cout << sum(q1) << endl;
return 0;
}
Console Output
1
2
3
4
Suppose Q contains these elements
Queue Elements: 2 5 2 1
Sum together
10