Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
44 changes: 44 additions & 0 deletions Queue Using Stacks/Queue Using Stacks - Costly Dequeue.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
#include <bits/stdc++.h>
using namespace std;

struct Queue {
stack<int> s1, s2;

void enQueue(int x)
{
s1.push(x);
}

int deQueue()
{
if (s1.empty() && s2.empty()) {
cout << "Q is empty";
exit(0);
}

if (s2.empty()) {
while (!s1.empty()) {
s2.push(s1.top());
s1.pop();
}
}

int x = s2.top();
s2.pop();
return x;
}
};

int main()
{
Queue q;
q.enQueue(1);
q.enQueue(2);
q.enQueue(3);

cout << q.deQueue() << '\n';
cout << q.deQueue() << '\n';
cout << q.deQueue() << '\n';

return 0;
}
47 changes: 47 additions & 0 deletions Queue Using Stacks/Queue Using Stacks - Costly Enqueue.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,47 @@
#include <bits/stdc++.h>
using namespace std;

struct Queue {
stack<int> s1, s2;

void enQueue(int x)
{
while (!s1.empty()) {
s2.push(s1.top());
s1.pop();
}

s1.push(x);

while (!s2.empty()) {
s1.push(s2.top());
s2.pop();
}
}

int deQueue()
{
if (s1.empty()) {
cout << "Q is Empty";
exit(0);
}

int x = s1.top();
s1.pop();
return x;
}
};

int main()
{
Queue q;
q.enQueue(1);
q.enQueue(2);
q.enQueue(3);

cout << q.deQueue() << '\n';
cout << q.deQueue() << '\n';
cout << q.deQueue() << '\n';

return 0;
}