Data-Structure-Programs/stack_array.cpp at master · akshay2742/Data-Structure-Programs · 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
#include<iostream>
using namespace std;
int stack[100], n=100, top=-1;
int i;

void push(int d)
{
    if (top>=n-1)
    {
        cout<<"Stack is Overflow";
    }
    else
    {
        top++;
        stack[top]=d;
    }

}
void pop()
{
    if (top<=-1)
    {
        cout<<"Stack is Underflow";
    }
    else
    {
        top--;
    }
}

void display()
{
    if (top<=-1)
    {
        cout<<"Stack is Undeerflow";
    }
    else
    {
        cout<<"Stack is: \n";
        for ( i = top; i >= 0; i--)
        {
            cout<<stack[i]<<"\n";
        }

    }
}

int topel()
{

    return stack[top];
}

int main()
{
    int n;
    push(9);
    push(7);
    push(5);
    push(2);
    push(3);
    pop();
    display();

    n=topel();
    cout<<"\nTop Element is: "<<n;

}