Data-Structures/basic_stack.java at master · ishitasinghal/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
public class Stackk
{
    static final int MAX=1000;
    int top;
    int starr[] = new int[MAX];

    void isEmpty()
    {
        if(top==-1)
        {
            System.out.println("Stack is empty");
        }
    }

    public void push(int e)
    {
        if(top>=(MAX-1))
        {
            System.out.println("Stack overflow");
        }
        else
        {
            starr[++top]=e;
        }
    }

    int pop()
    {
        if(top<0)
        {
            System.out.println("Stack underfloe");
            return 0;
        }
        else
        {
            int x=starr[top--];
            return x;
        }
    }

    int peek()
    {
        if(top<0)
        {
            System.out.println("Stack underflow");
            return 0;
        }
        else
        {
            int a=starr[top];
            return a;
        }
    }

public static void main(String args[])
{
    Stackk s = new Stackk();
        s.push(10);
        s.push(20);
        s.push(30);
        System.out.println(s.peek());
        s.pop();
        System.out.println(s.peek());

}
}