Rearrange a linked list in such a way that all odd position nodes are together and all even positions node are together,
Input: 1->2->3->4 Output: 1->3->2->4 Input: 10->22->30->43->56->70 Output: 10->30->56->22->43->70
The important thing in this question is to make sure that all below cases are handled
- Empty linked list.
- A linked list with only one node.
- A linked list with only two nodes.
- A linked list with an odd number of nodes.
- A linked list with an even number of nodes.
The below program maintains two pointers ‘odd’ and ‘even’ for current nodes at odd and even positions respectively. We also store the first node of the even linked list so that we can attach the even list at the end of the odd list after all odd and even nodes are connected together in two different lists.
Given Linked List 1->2->3->4->5->NULL Modified Linked List 1->3->5->2->4->NULL
Please refer complete article on Rearrange a linked list such that all even and odd positioned nodes are together for more details!