Alternate Splitting of a given Linked List

Objective: Given a singly linked list, split it into two linked lists. These linked lists will contain the alternate nodes from the given linked list.

Example:

Approach:

• Make two-pointers(headA and headB) and set it to head and next just to fix the headers for the new linked list.
• Make Node currNode = head and Node t = currNode.next.
• Do the traversal of the linked list.
• Make next = t.next and t.next = currNode.next.next. (Splitting step).
• Keep checking whether next!=null && currNode.next.next!=null.

Run This Code

Code:

Output:

->1->2->1->2->1->2
->1->1->1
->2->2->2

Also Read:

- Remove Duplicates from an Unsorted Linked list Beginner
- Convert a Sorted Doubly Linked List to Balanced BST. Medium
- Reverse Alternative 'k' nodes in a Linked List. Medium
- Find Intersection Point in Two Linked List Medium
- Reverse The Doubly Linked List Medium
- In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard
- Reverse a Linked List Beginner
- Merge Sort in a Linked list Medium