DSA/Stackss.java at main · Erenjaegaaa/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
import java.util.Scanner;
public class Stackss {

    int size;
    int top;
    int[]stack;


    Stackss(int size){

        this.size=size;
        top=-1;
        stack=new int[size];
    }

    void push(int data){
        if(top>=size-1){
            System.out.println("stack overflow");
            return;
        }
        top++;
        stack[top]=data;
    }
    void pop(){

        if(top==-1){
            System.out.println("stack underflow");
            return;
        }
        top--;
    }
    void traverse(){
        if(top==-1){
            System.out.println("stack underflow");
            return;
        }
        for(int i=top;i>=0;i--){
            System.out.println(stack[i]);
        }
    }

    public static void main(String[]args){
        Scanner sc=new Scanner(System.in);
        System.out.println("enter size of stack: ");
        int size=sc.nextInt();
        Stackss st=new Stackss(size);
        st.push(10);
        st.push(20);
        st.push(30);
        st.push(20);
        st.push(30);
        st.push(30);
        st.traverse();
        st.pop();
        st.traverse();
        st.pop();
        st.traverse();
        st.pop();
        st.traverse();

    }
}