-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.c
More file actions
93 lines (93 loc) · 1.25 KB
/
Stack.c
File metadata and controls
93 lines (93 loc) · 1.25 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
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
struct Stack
{
int size;
int top;
int* s;
};
void create(struct Stack* st)
{
printf("Enter Size");
scanf("%d", &st->size);
st->top = -1;
st->s = (int*)malloc(st->size * sizeof(int));
}
void Display(struct Stack st)
{
int i;
for (i = st.top; i >= 0; i--)
{
printf("%d ", st.s[i]);
}
printf("\n");
}
void push(struct Stack* st, int x)
{
if (st->top == st->size - 1)
{
printf("Stack Overflow");
}
else
{
st->top++;
st->s[st->top] = x;
}
}
int pop(struct Stack* st)
{
int x = -1;
if (st->top == -1)
{
printf("Stack underflow\n");
}
else
{
x = st->s[st->top--];
}
return x;
}
int peek(struct Stack st, int pos)
{
int x = -1;
if (st.top - pos + 1 < 0)
{
printf("Invalid Position");
}
else
{
x = st.s[st.top - pos + 1];
}
return x;
}
int isEmpty(struct Stack st)
{
if (st.top == -1)
return 1;
return 0;
}
int isFull(struct Stack st)
{
return st.top == st.size - 1;
}
int stackTop(struct Stack st)
{
if (!isEmpty(st))
return st.s[st.top];
return -1;
}
int main()
{
struct Stack st;
create(&st);
push(&st, 10);
push(&st, 20);
push(&st, 30);
push(&st, 40);
push(&st, 50);
printf("%d \n", peek(st, 2));
Display(st);
printf("%d \n", pop(&st));
return 0;
}