-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueueLL.cpp
More file actions
150 lines (108 loc) · 2 KB
/
Copy pathQueueLL.cpp
File metadata and controls
150 lines (108 loc) · 2 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
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
#include<iostream>
using namespace std;
class QUEUE
{
private:
struct node
{ int item; node* next;
node(int x)
{ item = x; next = 0; }
};
typedef node *link;
link head, tail;
public:
QUEUE(int)
{ head = 0; }
link getHead()
{
return head;
}
link getTail()
{
return tail;
}
void setHead(link h)
{
head=h;
}
int empty() const
{ return head == 0; }
void put(int x)
{
link t = tail;
tail = new node(x);
if (head == 0)
head = tail;
else t->next = tail;
}
int get()
{ int v = head->item;
link t = head;
head=head->next;
delete t;
return v; }
void peekAll()
{ /* implement this part */
link temp = head;
while(temp!=tail->next)
{
cout<<temp->item<<" ";
temp=temp->next;
}
}
QUEUE append(QUEUE q1,QUEUE q2)
{
while(q1.empty()!=0 && q2.empty()!=0)
{
q1.put(q2.get());
}
return q1;
}
int moveCount(QUEUE q,QUEUE p)
{
int count=0;
link t = p.getHead();
link tt = p.getTail();
while(t!=tt->next)
{
q.put(p.get());
count++;
t=t->next;
}
return count;
}
};
int main()
{
QUEUE q1(0);
QUEUE q2(0);
int element,e1;
cout<<"Enter elements for q1::"<<endl;
while(element!=-1)
{
cin>>element;
if(element!=-1)
{
q1.put(element);
}
}
cout<<"Enter elements for q2::"<<endl;
while(e1!=-1)
{
cin>>e1;
if(e1!=-1)
{
q2.put(e1);
}
}
// q1.append(q1,q2);
cout<<"q1 ::"<<endl;
q1.peekAll();
cout<<"q2 ::"<<endl;
q2.peekAll();
cout<<"count ::"<<endl;
cout<< q1.moveCount(q1,q2)<<endl;
// q1.append(q1,q2).peekAll();
}
// cout<<"Peeking the Queue"<<endl;
// q.peekAll();