charlespunk · February 12, 2013 15:35
diff --git a/CTCI 2.3 b/CTCI 2.3
 Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.
diff --git a/CTCI 2.3.java b/CTCI 2.3.java
 public static boolean deleteNode(Node node){
    if(node == null || node.next == null) return false; // could not be done when the next node is null
    node.data = node.next.date;
    node.next = node.next.next;
    return true;
 }
	public static boolean deleteNode(Node node){
	if(node == null \|\| node.next == null) return false; // could not be done when the next node is null
	node.data = node.next.date;
	node.next = node.next.next;
	return true;
	}