forked from rampatra/Algorithms-and-Data-Structures-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDeleteNode.java
36 lines (32 loc) · 893 Bytes
/
DeleteNode.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
package com.rampatra.linkedlists;
import com.rampatra.base.SingleLinkedList;
import com.rampatra.base.SingleLinkedNode;
/**
* Created by IntelliJ IDEA.
*
* @author rampatra
* @since 6/18/15
* @time: 2:35 PM
*/
public class DeleteNode {
/**
* Given a pointer to a node, delete it.
*
* @param node
* @param <E>
*/
public static <E extends Comparable<E>> void deleteNode(SingleLinkedNode<E> node) {
// assert node isn't the last node in the linked list
node.item = node.next.item;
node.next = node.next.next;
}
public static void main(String[] args) {
SingleLinkedList<Integer> linkedList = new SingleLinkedList<>();
linkedList.add(0);
linkedList.add(1);
linkedList.add(2);
linkedList.printList();
deleteNode(linkedList.getNode(1));
linkedList.printList();
}
}