-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinked_stack.cpp
More file actions
93 lines (84 loc) · 1.21 KB
/
Copy pathlinked_stack.cpp
File metadata and controls
93 lines (84 loc) · 1.21 KB
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
#include <iostream>
using namespace std;
template <class T>
class stack
{
public:
stack();
// ~stack();
void push(T newData);
void pop();
T top();
bool empty() const;
int size() const;
void print();
private:
struct stack_node
{
T data;
stack_node* next;
stack_node(T newData,stack_node* n):data(newData),next(n){}
};
int the_size;
stack_node* the_top;
};
template <class T>
void stack<T>::pop()
{
the_top=the_top->next;
the_size--;
}
template <class T>
int stack<T>::size() const
{
return the_size;
}
template <class T>
bool stack<T>::empty() const
{
return the_size==0;
}
template<class T>
stack<T>::stack()
{
the_size=0;
the_top=NULL;
}
template <class T>
void stack<T>::push(T newData)
{
stack_node* new_node=new stack_node(newData,NULL);
new_node->next=the_top;
the_top=new_node;
the_size++;
}
template <class T>
T stack<T>::top()
{
if(the_top!=NULL)
return the_top->data;
else return -1;
}
template <class T>
void stack<T>::print()
{
stack_node* temp=the_top;
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
int main()
{
stack<int> si;
si.push(4);
si.push(6);
si.push(8);
si.print();
si.pop();
si.pop();
si.print();
return 0;
}