This visualization demonstrates how to segregate a linked list by moving all even nodes to the beginning and all odd nodes to the end, while maintaining the relative order of nodes within each group.
Step 1: Original linked list with nodes 1 → 2 → 3 → 4 → 5 → 6