-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathStackUsingLL.java
98 lines (69 loc) · 1.55 KB
/
StackUsingLL.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
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
public class StackUsingLL {
StackNode top;
class StackNode{
int data;
StackNode next;
StackNode(int d) {
data = d;
next = null;
}
}
public boolean isEmpty(){
if(top == null){
return true;
}
return false;
}
public void push(int data) {
StackNode newNode = new StackNode(data);
newNode.next = top;
top = newNode;
System.out.println(data + " pushed to stack");
}
public void pop() {
if(top == null) {
System.out.println("Stack Underflow");
return;
}
top = top.next;
}
public int peek() {
if(top == null) {
System.out.println("Stack Underflow");
return 0;
}
return top.data;
}
public void print() {
if(top == null){
System.out.println("Stack Underflow");
return;
}
StackNode current = top;
while (current != null) {
System.out.print(current.data+" ");
current = current.next;
}
}
public static void main(String[] args){
StackUsingLL s = new StackUsingLL();
s.print();
s.peek();
s.pop();
s.push(5);
s.push(8);
s.push(6);
s.push(4);
s.push(2);
System.out.println(s.peek());
s.pop();
System.out.println(s.peek());
s.print();
if(s.isEmpty()){
System.out.println("Stack is Empty");
}
else{
System.out.println("Stack is not Empty");
}
}
}