DataStructures-Algorithms/Q_using_stack.cpp at main · JT-18/DataStructures-Algorithms · 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
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
#include<bits/stdc++.h>
using namespace std;

class Q
{
	stack<int> s1,s2;
	public:
	void Cenque(int);
	void deque();
	int front();
	bool empty();
	void enque(int);
	void Cdeque();
	int Cfront();
	bool Cempty();
};

void Q :: Cenque(int n)
{
	while(!s1.empty())
	{
		s2.push(s1.top());
		s1.pop();
	}
	s1.push(n);
	while(!s2.empty())
	{
		s1.push(s2.top());
		s2.pop();
	}
}

void Q :: deque()
{
	if(s1.empty())
		cout<<"Q is empty";

	else
		s1.pop();

}

int Q :: front()
{
	return s1.top();
}

bool Q :: empty()
{
	return s1.empty();
}

void Q :: enque(int n)
{
	s1.push(n);
}

void Q :: Cdeque()
{
	if(s1.empty() && s2.empty())
	{
		cout<<"Q is empty";
		return;
	}

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

int Q :: Cfront()
{
	if(s1.empty() && s2.empty())
	{
		return -1;
	}

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

	else
		return s2.top();
}

bool Q :: Cempty()
{
	return (s1.empty() && s2.empty());
}

int main()
{
	Q q,r;
	q.Cenque(1);
	q.Cenque(2);
	q.Cenque(3);
	cout<<"Queue Data :";
	while(!q.empty())
	{
		cout<<q.front()<<ends;
		q.deque();
	}

	r.enque(4);
	r.enque(5);
	r.enque(6);
	cout<<"\nCostly Deque Q data :";
	while(!r.Cempty())
	{
		cout<<r.Cfront()<<ends;
		r.Cdeque();
	}

}