forked from kant003/JavaPracticeHacktoberfest
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDoubly_Linked_List.java
104 lines (102 loc) · 2.35 KB
/
Doubly_Linked_List.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
99
100
101
102
103
104
class Node{
int data;
Node next;
Node prev;
Node()
{
data = 0;
next = null;
prev = null;
}
Node(int d){
data = d;
}
}
class LL{
Node head=null;
void printSLL(){
Node move = head;
while(move != null){
System.out.print(move.data+" ");
move = move.next;
}
System.out.println("");
}
void insertBeg(int d){
Node n = new Node(d);
n.prev = null;
n.next = head;
head = n;
System.out.println("Inserting at beginning.");
printSLL();
}
void insertEnd(int d){
Node n = new Node(d);
Node temp = head;
while(temp.next!=null){
temp = temp.next;
}
n.prev = temp.prev;
n.next = temp.next;
temp.next = n;
System.out.println("Inserting at End: ");
printSLL();
}
void insertPos(int d,int pos){
if (pos>0){
Node n = new Node(d);
Node temp = head;
for(int i = 0;i<pos-1;i++){
temp = temp.next;
}
n.prev = temp.prev;
n.next = temp.next;
temp.next = n;
System.out.println("Inserting at given position.");
printSLL();
}
}
void deleteBeg(){
head = head.next;
System.out.println("Deleting at beginning.");
printSLL();
}
void deleteEnd(){
Node temp = head;
Node t = temp;
while(temp.next != null){
t = temp;
temp = temp.next;
}
t.next = null;
System.out.println("Deleting at end.");
printSLL();
}
void deletePos(int pos){
Node temp = head;
Node t = temp;
for(int i = 0;i<pos-1;i++){
temp = temp.next;
t = temp.next.next;
}
t.prev = temp;
temp.next = temp.next.next;
System.out.println("Deleting at given position.");
printSLL();
}
}
public class DLL_Doubly_List {
public static void main(String[] args) {
LL ab = new LL();
ab.printSLL();
ab.insertBeg(12);
ab.insertBeg(24);
ab.insertBeg(36);
ab.insertBeg(48);
ab.insertEnd(20);
ab.insertPos(30,2);
ab.deleteBeg();
ab.deleteEnd();
ab.deletePos(2);
}
}