DSA/stackImplementationusingArrays.cpp at main · RushikeshKothawade07/DSA · 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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
/******************************************************************************

*******************************************************************************/

#include <stdio.h>
#include<stdlib.h>
struct stack{
    int size;
    int top;
    int *s;
};
void create(struct stack *st)
{

    printf("\nEnter size of the stack : ");
    scanf("%d",&st->size);
    st->top=-1;
    st->s=(int *)malloc(st->size*sizeof(int));

    }
}
void display (struct stack st)
{
    int i;
    printf("\nThe elements in the stack are : ");
    for(i=st.top;i>=0;i--)
    printf(" %d\t",st.s[i]);
    printf("\n");
}
void push(struct stack *st)
{
    printf("\nEnter ")
    if(st->top==st->size-1)
        printf("\nStack Overflow\n");
    else
    {
        st->top++;
        st->s[st->top]=x;
    }
}
int pop(struct stack *st)
{
    int z=-1;
    if(st->top==-1)
        printf("\nStack Underflow\n");
    else
    {
        z=st->s[st->top];
        st->top--;
    }
    return z;
}
int peek(struct stack st,int index)
{
    int x=-1;
    int a=st.top-index+1;
    if(a <0)
        printf("\nInvalid index\n");
    else
    {
        x=st.s[st.top-index+1];
    }
    return x;
}
void isEmpty(struct stack st)
{
    if(st.top==-1)
        printf("\nStack is Empty\n");
    else
        printf("\nStack is not empty\n");
}
void isFull(struct stack st)
{
    if(st.top==st.size-1)
        printf("\nStack is Full\n");
    else
        printf("\nStack is not Full\n");
}

int main()
{
    struct stack st;
    do
    {
        printf("Enter choice : \n 1.Create\n2.Push\n3.Pop\n4.Peek\n5.isEmpty\n6.isFull\n7.Display\n0.Exit");
        scanf("%d",&x);

        switch(x)
        {
            case 1: create(&st);
            break;
            case 2: push(&st);
            break;
            case 3: create(&st);
            break;
            case 4: create(&st);
            break;
            case 5: create(&st);
            break;
            case 6: create(&st);
            break;
            case 7: create(&st);
            break;

        }

    }while(x>=1 || x<=7)

    create(&st);


    display(st);
    //printf("\nPopped element is %d\n",pop(&st));


    // printf("\nThe element on the index %d  is %d\n",2,peek(st,2));
    // isFull(st);
    // isEmpty(st);


    return 0;
}