All testcase are not pass

@jatinkumarjk2001 hey,apne woh case choda hai jab even head NULL ho ya fir oddhead NULL ho.

Try this approach -
Traverse the linked list from the start. And whenever you encounter an even element, just push it to the end of the linked list.
I will explain you with the help of an example -
Lets say the input linked list is - 2 3 6 1 1 5
We start from 2. It is even, so we push it to the end. And our intermediate linked list becomes - 3 6 1 1 5 2
Now we are at 3 and it is odd. So we just increment our pointer.
Now the element 6 is even. So we again push it to the end and our intermediate linked list becomes - 3 1 1 5 2 6
Then we move on to 1 which is odd and just increment. And like this we finally reach the last element of our original linked list which is 5. So we stop there and display the final linked list.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.