-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstackintro.cpp
More file actions
88 lines (69 loc) · 1.87 KB
/
Copy pathstackintro.cpp
File metadata and controls
88 lines (69 loc) · 1.87 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
#include<iostream>
#include<stack>
using namespace std;
class stack { // class
// properties
int *arr;
int top;
int size;
// constructor
stack(int size) { // ye jo upar int size hai uske hi parameter
this -> size = size;
arr = new int(size);
top = -1; // top=-1 matalb apn n isse khali intialize kar diya
}
void push(int element) { // push
if(size - top>1) { // atleast 1 toh bhi khali jagh rhna chaiye tabhi apn naya kuch push karenge n
top++; // push
arr[top] = element;
}
else{
cout<<"stack overflow"<< endl; // khali hai hi nhi toh stack overflow
}
}
void pop() {
if(top>=0) { // kuch usme rhega tabhi pop karenga n isley >=0 MATALB TOP ME ATLEAST 1 TOH RHE
cout << " stack underflow" << endl;
}
}
int peek() { // upar se top wala elemnt
if(top>=0 && top<size)
return arr[top];
else
{
cout << "stack is empty" << endl;
return -1;
}
}
bool isEmpty() { // empty hai ya nhi check krna hai apneko
if ( top == -1) { // top == -1 hai toh apna stack empty return -1
return true;
}
else {
return false;
}
}
};
int main() {
stack st(5);
st.push(22);
st.push(43);
st.push(44);
st.push(22);
st.push(43);
st.push(44);
cout << st.peek() << endl;
st.pop();
cout << st.peek() << endl;
st.pop();
cout << st.peek() << endl;
st.pop();
cout << st.peek() << endl;
if(st.isEmpty()) {
cout << "Stack is Empty mere dost " << endl;
}
else{
cout << "Stack is not Empty mere dost " << endl;
}
return 0;
}