-
Notifications
You must be signed in to change notification settings - Fork 36
/
stackUsingLinkedList.cpp
100 lines (82 loc) · 1.18 KB
/
stackUsingLinkedList.cpp
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
#include <iostream>
using namespace std;
template <typename T>
class Node
{
public:
T data;
Node * next;
Node(T data)
{
this->data=data;
this->next=NULL;
}
};
template <typename T>
class Stack
{
private:
Node <T> * head;
int totsize;
public:
Stack()
{
head=NULL;
totsize=0;
}
void push(T data)
{
Node <T> * newnode=new Node <T> (data);
newnode->next=head;
head=newnode;
totsize++;
}
int totalsize()
{
return totsize;
}
bool isEmpty()
{
if (totsize==0)
{
return true;
}
return false;
}
T pop()
{
if (totsize==0)
{
cout<<"Stack is empty"<<endl;
return 0;
}
Node <T> * temp=head;
T data=temp->data;
head=temp->next;
delete temp;
totsize--;
return data;
}
T top()
{
if (totsize==0)
{
return 0;
}
return head->data;
}
};
int main()
{
Stack <int> s1;
s1.push(10);
s1.push(20);
s1.push(30);
cout<<s1.totalsize()<<endl;
cout<<s1.top()<<endl;
cout<<s1.pop()<<endl;
cout<<s1.pop()<<endl;
cout<<s1.pop()<<endl;
cout<<s1.pop()<<endl;
return 0;
}