We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Delete a Node
  5. Discussions

Delete a Node

  • jayantnishad34
     + 0 comments

    public static SinglyLinkedListNode deleteNode(SinglyLinkedListNode llist, int position) { if (llist == null) return null; // If the list is empty, return null

    if (position == 0) return llist.next; // If deleting the head, return the next node

SinglyLinkedListNode prev = llist;
for (int i = 0; prev.next != null && i < position - 1; i++) {
    prev = prev.next;
}

if (prev.next != null) {
    prev.next = prev.next.next; // Skip the target node
}

return llist;
}