forked from Aishwaryanair0320/Basic-Data-Structures
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathStack.java
More file actions
64 lines (57 loc) · 1019 Bytes
/
Copy pathStack.java
File metadata and controls
64 lines (57 loc) · 1019 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
import java.util.*;
class Node {
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class LinkedList {
Node top;
public LinkedList() {
this.top = null;
}
public void push(int data) {
Node temp;
Node newNode = new Node(data);
if(top == null) {
top = newNode;
} else {
newNode.next = top;
top = newNode;
}
}
public void pop() {
Node temp;
if(top == null) {
System.out.println("Invalid");
}
else {
for(temp = top;temp.next != null;temp = temp.next);
top = top.next;
temp.next = null;
}
}
public void print() {
Node temp;
if(top == null) {
System.out.println("Stack Underflow");
}
else {
for(temp = top; temp!=null;temp = temp.next) {
System.out.println(temp.data);
}
}
}
}
public class Stack {
public static void main(String[] args) {
LinkedList L = new LinkedList();
L.push(5);
L.push(7);
L.push(8);
L.pop();
L.print();
}
}