datastructurelaboratory/stack.java at main · SRINIVASAN2001/datastructurelaboratory · 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
125


import java.util.*;

 class Stack {

    static final int MAX = 1000;

    int top;

    int a[] = new int[MAX];


    boolean isEmpty()

    {

        return (top < 0);

    }

    Stack()

    {

        top = -1;

    }


    boolean push(int x)

    {

        if (top >= (MAX - 1)) {

            System.out.println("Stack Overflow");

            return false;

        }

        else {

            a[++top] = x;

            System.out.println(x + " pushed into stack");

            return true;

        }

    }


    int pop()

    {

        if (top < 0) {

            System.out.println("Stack Underflow");

            return 0;

        }

        else {

            int x = a[top--];

            return x;

        }

    }


    int peek()

    {

        if (top < 0) {

            System.out.println("Stack Underflow");

            return 0;

        }

        else {

            int x = a[top];

            return x;

        }

    }

}

class Main {

    public static void main(String args[])

    {

        Stack s = new Stack();

        s.push(10);

        s.push(20);

        s.push(30);

        System.out.println(s.pop() + " Popped from stack");

    }

}