-
Notifications
You must be signed in to change notification settings - Fork 0
/
Lesson16.cpp
76 lines (73 loc) · 1.04 KB
/
Lesson16.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
#include<bits/stdc++.h>
using namespace std;
struct Node{
int data;
Node* next;
};
class Stack{
Node* top;
public:
Stack()
{
top=NULL;
}
void push(int x)
{
Node* temp=new Node();
temp->data=x;
temp->next=NULL;
if(top==NULL)
{
top=temp;
}
else
{
temp->next=top;
top=temp;
}
}
void pop()
{
if(top==NULL)
{
cout<<"stack empty"<<endl;
}
else
{
Node* temp=top;
top=top->next;
delete temp;
}
}
bool isEmpty()
{
if(top==NULL)
{
return true;
}
return false;
}
void print()
{
Node* temp=top;
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
};
int main()
{
Stack s;
s.push(2);
s.print();
s.push(3);
s.push(4);
s.push(5);
s.print();
s.pop();
s.pop();
s.print();
}