Put the odd nodes in a linked list and the even nodes in another. Then link the evenList to the tail of the oddList.
The solution is very intuitive. But it is not trivial to write a concise and bug-free code.
LinkedList need two pointers head and tail to support operations at both ends. The variables
odd are the head pointer and tail pointer of one
LinkedList we call oddList; the variables
even are the head pointer and tail pointer of another
LinkedList we call evenList. The algorithm traverses the original LinkedList and put the odd nodes into the oddList and the even nodes into the evenList. To traverse a LinkedList we need at least one pointer as an iterator for the current node. But here the pointers
even not only serve as the tail pointers but also act as the iterators of the original list.
The best way of solving any linked list problem is to visualize it either in your mind or on a piece of paper. An illustration of our algorithm is following:
Figure 1. Step by step example of the odd and even linked list.
Time complexity : . There are total nodes and we visit each node once.
Space complexity : . All we need is the four pointers.