forked from Shradha27/codezilla
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSinglyLinkedList.java
More file actions
264 lines (251 loc) · 6.49 KB
/
Copy pathSinglyLinkedList.java
File metadata and controls
264 lines (251 loc) · 6.49 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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
/**
* This class Implements Singly Linked List
*
* @author hamza39460
*/
public class SinglyLinkedList<T> {
/* Linked List Node */
private static class Node<K> {
/*data in Node*/
K data;
/*Next node reference*/
Node next;
Node() {
}
/**
* Constructor
*
* @param d to initialize data
*/
Node(K d) {
data = d;
}
}
/*Head Reference to Front of List */
private Node<T> headNode;
/*Size of List*/
private int listSize;
/**
* Constructor for class SinglyLinkedList Initialize head Reference to Null
* Initialize Size of list to 0
*/
public SinglyLinkedList() {
headNode = null;
listSize = 0;
}
/*
* @return head Reference of Node
*/
public Node headNode() {
return headNode;
}
/*
* @return size of list
*/
public int listSize() {
return listSize;
}
/**
* create new new Node increment in list size
*
* @param T data to store in new node
* @return Reference of new Node
*/
private Node addNode(T data) {
Node<T> newNode = new Node(data);
listSize++;
return newNode;
}
/**
* Add Node at the end of list
*
* @param data for data of new Node
*/
public void addAtEnd(T data) {
Node<T> newNode = addNode(data);
if (headNode == null) {
headNode = newNode;
} else {
Node<T> temp = headNode;
while (temp.next != null) {
temp = temp.next;
}
temp.next = newNode;
}
}
/**
* Add Node at the front of List
* @param data for date of new node
*/
public void addAtFront(T data) {
Node<T> newNode = addNode(data);
newNode.next = headNode;
headNode = newNode;
}
/**
* add Node at specific index
*
* @param data to add data in new Node
* @param index index where new node has to be created
*/
public void addAtPosition(T data, int index) {
if (index <= 0) {
this.addAtFront(data);
} else if (index >= listSize) {
this.addAtEnd(data);
} else {
Node<T> newNode = addNode(data);
Node<T> temp = headNode;
Node<T> tempTail = null;
int tempIndex = 0;
while (tempIndex < index && temp.next != null) {
tempTail = temp;
temp = temp.next;
tempIndex++;
}
newNode.next = temp;
tempTail.next = newNode;
}
}
/**
* delete Given key
* @param key data to be deleted
* @return
* true if deleted successfully
* false if deletion was unsuccessful
*/
public boolean delete(T key) {
if (headNode != null) {
if (headNode.data == key) {
headNode = headNode.next;
} else {
Node<T> temp = headNode;
Node<T> tempTail = null;
while (temp != null && temp.data != key) {
tempTail = temp;
temp = temp.next;
}
if (temp == null) {
return false;
} else {
tempTail.next = temp.next;
}
}
listSize--;
return true;
}
return false;
}
/**
* delete first node
* @return
* true if deleted successfully
* false if deletion was unsuccessful
*/
public boolean deleteHead() {
if (headNode != null) {
headNode = headNode.next;
listSize--;
return true;
}
return false;
}
/**
* delete last node
* @return
* true if deleted successfully
* false if deletion was unsuccessful
*/
public boolean deleteTail() {
if (headNode != null) {
Node<T> temp = headNode;
Node<T> tempTail = temp;
while (temp.next != null) {
tempTail = temp;
temp = temp.next;
}
tempTail.next = null;
listSize--;
return true;
}
return false;
}
/**
* delete node at specific index
* @param index the node to be deleted
* @return
* true if deleted successfully
* false if deletion was unsuccessful
*/
public boolean deleteIndex(int index) {
if (headNode != null) {
if (index >= 0 && index < listSize) {
if (index == 0) {
this.deleteHead();
} else if (index == listSize - 1) {
this.deleteTail();
} else {
Node<T> temp = headNode;
Node<T> tempTail = null;
int tempIndex = 0;
while (tempIndex < index && temp != null) {
tempTail = temp;
temp = temp.next;
tempIndex++;
}
if (temp != null) {
tempTail.next = temp.next;
}
}
listSize--;
return true;
}
return false;
}
return false;
}
/**
* delete whole list
* @return
* true if deleted successfully
* false if deletion was unsuccessful
*/
public boolean deleteList() {
while (headNode != null) {
headNode = headNode.next;
}
return true;
}
/**
* Print List
*/
public void printList() {
Node temp = headNode;
while (temp != null) {
System.out.print(temp.data);
System.out.print(" ");
temp = temp.next;
}
System.out.println();
}
// Driver Program
public static void main(String args[])
{
SinglyLinkedList<Character> obj;
obj = new SinglyLinkedList();
obj.addAtEnd('A');
obj.addAtEnd('B');
obj.addAtEnd('C');
obj.addAtFront('D');
obj.addAtPosition('E' ,3);
obj.printList();
obj.deleteIndex(2);
obj.printList();
obj.delete('A');
obj.printList();
obj.deleteHead();
obj.printList();
obj.deleteTail();
obj.printList();
}
}