BeginHacktoberFest2020/Basic_Stack_Operations.c at master · vasundhravv/BeginHacktoberFest2020 · 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
76
77
78
79
80
81
82
83
84
85
86
#include<stdio.h>
#include<stdlib.h>
#define maxsize 20


int top=-1,i,n,stack[maxsize],element;


void check()
{
	if(top == -1)
	{
		printf("Stack empty\n");
	}
	else
	{
		printf("Stack has elements \n");
	}
}

void push()
    {
    if(top==maxsize)
    {
    printf("stack overflow");

    }
    else
    {
    printf("Enter the element to  push it");
    scanf("%d",&element);
    stack[++top]=element;
    }
    }

int pop()
{
    if(top==-1)
        printf("\nstack underflow\n");

    else
    {
        element=stack[top];
        top--;
        return element;

    }

}


void display()
{
    for(i=top ; i >=0 ; i--)
        printf("%d\n\n\n",stack[i]);

}

int main()
{
    int ch,ele;
    while(1)
    {
        printf("choose the opeartion >>>>>>>\n");
        printf("0-Checkempty\n1-push\n2-pop\n3-display\n4-exit\n\n======================\n>");
        scanf("%d",&ch);

        switch(ch)
        {

        case 0 : check(); break;
        case 1 : push(); break;
        case 2 : ele=pop(); printf("the poped element is %d\n",ele); break;
        case 3 : display(); break;
        case 4 : exit(0); break;
        default : printf("invalid choice !");

        }


    }

}