forked from AlbinoB/Data_Structures_With_Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStackOperations.java
More file actions
71 lines (45 loc) · 941 Bytes
/
Copy pathStackOperations.java
File metadata and controls
71 lines (45 loc) · 941 Bytes
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
package stack;
import java.util.ArrayList;
import java.util.List;
public class StackOperations<T>{
private Node<T> top=null;
public void push(T data) {
Node<T> newNode=new Node<T>(data);
if(top==null) {
top=newNode;
}else {
newNode.next=top;
top=newNode;
}
}
public T pop() {
if(top==null) {
return null;//stack is empty
}else {
Node<T> temp=top;
T data=(T) top.data;
top=top.next;
temp=null;//free memory
return data;//return top element of stack after it has been popped
}
}
public T peek() {
if(top==null) {
return null;//stack is empty
}else {
return (T) top.data;//return top element of stack
}
}
public void displayStack() {
if(peek()==null) {
System.out.println("stack is empty");
return;
}
Node<T> temp=top;
while(temp!=null)
{
System.out.println(temp.data);
temp=temp.next;
}
}
}