Basic-Data-Structures/stack using array at main · rahulzach/Basic-Data-Structures · GitHub

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
#include<stdio.h>
#include<stdlib.h>


void push();
void pop();
void display();

int a[10],max,i;
int top=-1;


void push()
{int item;
if(top==max-1)
{
    printf("the stack is full\n");
}
else{
    printf("enter item to be pushed\n");
    scanf("%d",&item);
    top=top+1;
    a[top]=item;
}
}


void pop(){
if(top==-1){
    printf("Stack is empty\n");
}
else{
    printf("%d is poppped \n",a[top]);
    top=top-1;
}
}

void display(){
if(top==-1){
    printf("stack is empty\n");
}
else{
        for(i=0;i<=top;i++)
        {
            printf("%d\t",a[i]);
        }
        printf("\n");
}
}

void main()
{
    int ch;
    printf("nter max size : ");
    scanf("%d",&max);
    while(1)
    {
    printf("nter choice: \n 1 push \n 2 pop \n 3 disp \n");
    scanf("%d",&ch);
    switch(ch){
    case 1:push();
    break;
    case 2:pop();
    break;
    case 3:display();
    break;
    case 4:exit(0);
    default: printf("incvald ch\n");
    break;
    }
    }


}