Given a singly linked list, group all odd nodes together followed by the even nodes. : Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.

Example:
Given 1->2->3->4->5->NULL,
return 1->3->5->2->4->NULL.


I have seen the solution but I can't understand it, I need someone to visually explain the solution to the problem.