-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStackClass.java
64 lines (59 loc) · 1.71 KB
/
StackClass.java
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
//Stack using Linked List
//import java.util.Stack;
public class StackClass {
//defining data and next of a node
private static class Node{
int data;
Node next;
Node(int data){
this.data = data;
next = null;
}
}
//defining push(),pop(),peek()
static class Stack{
public static Node head = null;
//push() operation
public static void push(int data){
Node newNode = new Node(data);
if(head == null){
head = newNode;
return;
}
newNode.next = head; //making old head as newNode's next
head = newNode;
}
public static boolean isEmpty(){
return head==null;
}
//pop() operation
public int pop(){
if (isEmpty()) {
return -1;
}
Node top = head;
head = head.next;
return top.data;
}
//peek() operation
public int peek(){
if(isEmpty()){
return -1;
}
Node top = head;
return top.data;
}
}
@SuppressWarnings("static-access")
public static void main(String[] args) {
Stack s = new Stack();
s.push(1);
s.push(2);
s.push(3);
s.push(4);
while (!s.isEmpty()) {
System.out.println(s.peek());
s.pop();
}
}
}