Delete a node in the middle of a singly linked list,given only access to that node.

Very simple problem but there is only issue with the solution is if the node to be deleted is the last node in the linked list. public static boolean deleteNode(LinkedListNode n) { if(n == null || n.next == null) return false; LinkedListNode next =n.next; n.data =next.data; n.next=next.next; return true; }

#DesignPattern #LinkedList #CoreJava #DataStructure