Delete a node of the last element in the linked list algorithm in java?

Answer 1

Well if you're using the build in LinkedList class, you can simply call list.removeLast().

But let's assume you're not:

class LinkedList {

LinkedListNode root;

public void removeLast() {

// special case for an empty list

if( root null ) {

root = null;

return;

}

// iterate through list, starting at root

LinkedListNode last = null;

LinkedListNode current = root;

// when current.next is null, current is the last element of this list and

// last will become the new last element

while( current.next != null ) {

last = current;

current = current.next;

}

// cut off current

last.next = null;

}

private class LinkedListNode {

Object data;

LinkedListNode next = null;

}

}

Answer 2

To delete the last node of a singly linked list in Java, you can traverse the list and stop at the second-to-last node. Update the next reference of this node to null, effectively removing the last node from the list. This can be done by iterating through the list until reaching the second-to-last node and setting its next reference to null.