forked from rampatra/Algorithms-and-Data-Structures-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDeleteAlternateNodes.java
40 lines (32 loc) · 1.02 KB
/
DeleteAlternateNodes.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
package me.ramswaroop.linkedlists;
import me.ramswaroop.common.SingleLinkedList;
import me.ramswaroop.common.SingleLinkedNode;
/**
* Created by IntelliJ IDEA.
*
* @author: ramswaroop
* @date: 6/27/15
* @time: 5:27 PM
*/
public class DeleteAlternateNodes {
public static <E extends Comparable<E>> void deleteAlternateNodes(SingleLinkedList<E> list) {
deleteAlternateNodes(list.head);
}
public static <E extends Comparable<E>> void deleteAlternateNodes(SingleLinkedNode<E> node) {
if (node == null || node.next == null) return;
node.next = node.next.next;
deleteAlternateNodes(node.next);
}
public static void main(String a[]) {
SingleLinkedList<Integer> linkedList = new SingleLinkedList<>();
linkedList.add(00);
linkedList.add(11);
linkedList.add(22);
linkedList.add(33);
linkedList.add(44);
linkedList.add(55);
linkedList.printList();
deleteAlternateNodes(linkedList);
linkedList.printList();
}
}