Here there few queries :
- Is it a single linked list or Double Linked List ?
- can we make this list circular ?
If the List is circular, we can get the corrupted node by iterating through the circular list and same with doubly linked list.
If the linked list is Single and not circular then,
the following can be implemented in the linked list to detect the corrupted link:
1. Use skip list.
2. use address of next to next node in Node.
3. convert the List to circular to detect the corrupted linked (if possible).