-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.java
More file actions
85 lines (71 loc) · 1.24 KB
/
Stack.java
File metadata and controls
85 lines (71 loc) · 1.24 KB
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
import java.util.*;
public class Stack {
private ListNode top;
private int length;
private class ListNode{
private int data;
private ListNode next;
public ListNode(int data) {
this.data=data;
}
}
public Stack()
{
top=null;
length=0;
}
public int length()
{
return length;
}
public boolean isEmpty()
{
return length==0;
}
public void push()
{
System.out.println("Enter the element you want to push into the stack");
Scanner sc=new Scanner(System.in);
int value=sc.nextInt();
ListNode temp=new ListNode(value);
temp.next=top;
top=temp;
length++;
}
public void pop()
{
if(isEmpty())
{
System.out.println("Empty Stack!!");
}
else {
int result=top.data;
top=top.next;
length--;
System.out.println("Element popped is:" +result);
}
}
public void peek()
{
if(isEmpty())
{
System.out.println("Empty Stack!!");
}
else {
System.out.println("Top most data is:" +top.data);
}
}
public static void main(String args[])
{
Stack st=new Stack();
// To push elements into stack
st.push();
st.push();
st.push();
st.push();
// To pop elements from stack
st.pop();
// TO search for the topmost element in the stack
st.peek();
}
}