forked from srishilesh/Data-Structure-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstacklinkedlist.java
63 lines (62 loc) · 1.11 KB
/
stacklinkedlist.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
public class stacklinkedlist {
StackNode root;
static class StackNode{
int data;
StackNode next;
StackNode(int data)
{
this.data = data;
}
}
public boolean isEmpty()
{
if(root == null)
return true;
else
return false;
}
public void push(int data)
{
StackNode node = new StackNode(data);
if(root == null)
root = node;
else
{
StackNode temp = root;
root = node;
node.next = temp;
}
System.out.println(data + " pushed to stack");
}
public int pop()
{
int popped = Integer.MIN_VALUE;
if(root == null)
System.out.println("Stack is empty");
else
{
popped = root.data;
root = root.next;
}
return popped;
}
public int peek()
{
if (root == null) {
System.out.println("Stack is empty");
return Integer.MIN_VALUE;
}
else {
return root.data;
}
}
public static void main(String args[])
{
stacklinkedlist sll = new stacklinkedlist();
sll.push(10);
sll.push(20);
sll.push(30);
System.out.println("Popping "+sll.pop());
System.out.println("Peeking "+sll.peek());
}
}