DSalgorithm/stacklinked.cpp at master · Nickhil1737/DSalgorithm · 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

#include<bits/stdc++.h>
using namespace std;

/***************************************ORIGINAL aUTHOR*******************************
 *************************************************************************************
 *************************************************************************************
 *************astrainL3gi0N**********************************************************/

struct Node
{
	int item;
	Node *next;
	Node(int it, Node *nn){
		item = it;
		next = nn;
	}
}*top;

class stac
{
	public:
		void push(int item){
			Node *x = new Node(item,top);
			top = x;
		}

		int pop(){
			if(top == NULL){
				cout<<"underflow\n";
				return -1;
			}
			int n = top->item;
			top = top->next;
			return n;
		}
};


int main()
{

	int n;	cin>>n;

	stac s;
	for(int i = 0; i < n; ++i){
		int k;	cin>>k;
		s.push(k);
	}
	for(int i = 0; i <= n; ++i)
		cout<<s.pop()<<' ';

	return 0;

}