-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedListMiddleElement.java
More file actions
97 lines (82 loc) · 2.22 KB
/
LinkedListMiddleElement.java
File metadata and controls
97 lines (82 loc) · 2.22 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
package Collection;
public class LinkedListMiddleElement extends Node {
Node head = null;
public Node createNode(String name) {
Node node = new Node();
node.name = name;
node.next = null;
return node;
}
public void add(String name) {
Node newNode = createNode(name);
if (head == null) {
head = newNode;
} else {
Node temp = head;
while (temp.next != null) {
temp = temp.next;
}
temp.next = newNode;
}
}
public void middleElement() {
if (head == null) {
System.out.println("List is empty");
return;
}
int count = 0;
Node temp = head;
while (temp != null) {
count++;
temp = temp.next;
}
temp = head;
for (int i = 0; i < count / 2; i++) {
temp = temp.next;
}
System.out.println("Middle element: " + temp.name);
}
public void printMyLinkedList() {
Node temp = head;
while (temp != null) {
System.out.println(temp.name);
temp = temp.next;
}
}
public int getlength(){
Node temp =head;
int count =0;
while(temp!= null){
temp = temp.next;
count++;
}
System.out.println(count);
return count;
}
public void deletemiddlenode(){
int lengthofLL = getlength();
int getMiddle = (lengthofLL / 2) - 1;
Node temp = head;
while(getMiddle > 0){
temp = temp.next;
getMiddle--;
}
Node temp2 = temp.next;
temp.next = temp2.next;
temp2.next = null;
}
public static void main(String[] args) {
LinkedListMiddleElement list = new LinkedListMiddleElement();
list.add("20");
list.add("30");
list.add("50");
list.add("60");
list.add("70");
list.printMyLinkedList();
list.middleElement();
System.out.println("After deleting middle element:");
list.deletemiddlenode();
list.printMyLinkedList();
}
}
//This code finds middle element of linked list