DSAcodes/Reverse Stack.cpp at master · ankit-songara/DSAcodes · 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
#include<iostream>
using namespace std;
struct stack
{
	int size;
	int top;
	int element[50];
};

void push(stack &s, int x)
{
	if(s.top==s.size-1)
	{
		cout<<"Stack is full";
	}
	else
	{
		s.top++;
		s.element[s.top]=x;
	}
}

int pop(stack &s)
{
	if(s.top==-1)
	{
		cout<<"Stack is empty";
	}
	else
	{
		return(s.element[s.top--]);

	}
}

int peep(stack &s)
{
	if(s.top==-1)
	{
		cout<<"Stack is empty";
	}
	else
	{
		return s.element[s.top];
	}
}

int main()
{
	stack s1,s2;
	s1.size=10;
	s2.size=10;
	s1.top=-1;
	s2.top=-1;
	int n[6],i=0,a;
	for(int i=0;i<6;i++)
	{
		cin>>n[i];
	}
	i=6;
	while(i>=0)
	{
		push(s1,n[i]);
		i--;
	}
	i=0;
	while(i<6)
	{
		a=pop(s1);
		push(s2,a);
		i++;
	}

	while(s2.top>=0)
	{
		cout<<pop(s2)<<" ";
	}
}