stack_array.c
stacks Implementation
78 lines1417 bytesC
1// Stack using Array
2#include <stdio.h>
3#include <stdlib.h>
4#define MAX 100
5
6struct Stack {
7 int top;
8 int arr[MAX];
9};
10
11void initStack(struct Stack* stack) {
12 stack->top = -1;
13}
14
15int isFull(struct Stack* stack) {
16 return stack->top == MAX - 1;
17}
18
19int isEmpty(struct Stack* stack) {
20 return stack->top == -1;
21}
22
23void push(struct Stack* stack, int data) {
24 if (isFull(stack)) {
25 printf("Stack Overflow!\n");
26 return;
27 }
28 stack->arr[++stack->top] = data;
29 printf("Pushed %d\n", data);
30}
31
32int pop(struct Stack* stack) {
33 if (isEmpty(stack)) {
34 printf("Stack Underflow!\n");
35 return -1;
36 }
37 return stack->arr[stack->top--];
38}
39
40int peek(struct Stack* stack) {
41 if (isEmpty(stack)) {
42 printf("Stack is empty!\n");
43 return -1;
44 }
45 return stack->arr[stack->top];
46}
47
48void display(struct Stack* stack) {
49 if (isEmpty(stack)) {
50 printf("Stack is empty!\n");
51 return;
52 }
53 printf("Stack: ");
54 for (int i = 0; i <= stack->top; i++) {
55 printf("%d ", stack->arr[i]);
56 }
57 printf("\n");
58}
59
60int main() {
61 struct Stack stack;
62 initStack(&stack);
63
64 push(&stack, 10);
65 push(&stack, 20);
66 push(&stack, 30);
67 push(&stack, 40);
68
69 display(&stack);
70
71 printf("Top element: %d\n", peek(&stack));
72 printf("Popped: %d\n", pop(&stack));
73
74 display(&stack);
75
76 return 0;
77}
78