datastructurelaboratory/queue.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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
import static java.lang.System.exit;


class StackUsingLinkedlist {


    private class Node {

        int data;

        Node link;

    }


    Node top;


    StackUsingLinkedlist()

    {

        this.top = null;

    }

    public void push(int x)

    {


        Node temp = new Node();

        if (temp == null) {

            System.out.print("\nHeap Overflow");

            return;

        }

        temp.data = x;


        temp.link = top;


        top = temp;

    }


    public boolean isEmpty()

    {

        return top == null;

    }


    public int peek()

    {


        if (!isEmpty()) {

            return top.data;

        }

        else {

            System.out.println("Stack is empty");

            return -1;

        }

    }


    public void pop()

    {


        if (top == null) {

            System.out.print("\nStack Underflow");

            return;

        }

        top = (top).link;

    }


    public void display()

    {


        if (top == null) {

            System.out.printf("\nStack Underflow");

            exit(1);

        }

        else {

            Node temp = top;

            while (temp != null) {


                System.out.printf("%d->", temp.data);

                temp = temp.link;

            }

        }

    }
}

public class GFG {

    public static void main(String[] args)

    {

        StackUsingLinkedlist obj = new StackUsingLinkedlist();

        obj.push(11);

        obj.push(22);

        obj.push(33);

        obj.push(44);


        obj.display();


        System.out.printf("\nTop element is %d\n", obj.peek());


        obj.pop();

        obj.pop();


        obj.display();


        System.out.printf("\nTop element is %d\n", obj.peek());

    }
}