-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathusing array.cpp
70 lines (65 loc) · 1.14 KB
/
using array.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
#include <bits/stdc++.h>
using namespace std;
struct Stack
{
int size;
int top;
int *arr;
};
int is_Empty(struct Stack *ptr)
{
if (ptr->top == -1)
{
return 1;
}
else
return 0;
}
int is_Full(struct Stack *ptr)
{
if (ptr->top == ptr->size - 1)
{
return 1;
}
else
{
return 0;
}
}
void push(struct Stack *ptr, int value)
{
if (is_Full(ptr)==1)
{
cout << "Stack is full (case:over flow )\n";
}
else
{
ptr->top++;
ptr->arr[ptr->top] = value;}
}
void pop(struct Stack *ptr)
{
if (is_Empty(ptr)==1)
{
cout << "STack is empty (case:underflow)\n";
}
else
{
int value = ptr->arr[ptr->top];
ptr->top--;
cout << "poped number is" << value << endl;
}
}
int main()
{
struct Stack *sp = (struct Stack *)malloc(sizeof(struct Stack));
sp->size = 10;
sp->top = -1;
sp->arr=(int *)malloc(sizeof(int)*sp->size);
push(sp, 50);
push(sp,60);
push(sp,77);
push(sp,90);
pop(sp);
return 0;
}