would this code delete the last node in linked list?

Question

Its just a code snippet, but considering everything else has been coded right, would this logically delete the last node? Or is my logic faulty?

Question answered.

Answer 1

Currently, the code would throw an exception as current would be null after exiting the while loop. The correct version of the method (with deletion from a specific position) might look something like the following:

public static Node delete(Node head, int position)
{
    Node traverse = head;
    if(position == 0) { 
        //remember this case
        head = head.next;
        return head;
    }

    for(int i = 1; i < position; i++)
        traverse = traverse.next;

    Node deleteit = traverse.next; //want to skip over this node
    traverse.next = deleteit.next; 

    return head;
}