LinkedList-Even after Odd LinkedList

For a given singly linked list of integers, arrange the elements such that all the even numbers are placed after the odd numbers. The relative order of the odd and even terms should remain unchanged.
Note :
No need to print the list, it has already been taken care. Only return the new head to the list.
Input format:
The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.

The first line of each test case or query contains the elements of the singly linked list separated by a single space. 
 Remember/Consider :
While specifying the list elements for input, -1 indicates the end of the singly linked list and hence, would never be a list element
Output format:
For each test case/query, print the elements of the updated singly linked list.

Output for every test case will be printed in a seperate line.
Constraints :
1 <= t <= 10^2
0 <= M <= 10^5
Where M is the size of the singly linked list.

Time Limit: 1sec
Sample Input 1 :
1
1 4 5 2 -1
Sample Output 1 :
1 5 4 2 
Sample Input 2 :
2
1 11 3 6 8 0 9 -1
10 20 30 40 -1
Sample Output 2 :
1 11 3 9 6 8 0]
10 20 30 40

******************************************Code************************************
public static LinkedListNode<Integer> evenAfterOdd(LinkedListNode<Integer> head) {
if(head==null || head.next==null)
            return head;
        
        LinkedListNode<Integer> eh=null,et=null,oh=null,ot=null;
        while(head!=null){
            if(head.data%2==0){
                if(eh==null && et==null)
                {
                    eh=head;
                    et=head;

                }
                else{
                    et.next=head;
                    et=head;

                }
                head=head.next;
            }
            else{
                if(oh==null && ot==null)
                {
                    oh=head;
                    ot=head;
                }
                else{
                    ot.next=head;
                    ot=head;
                }
                head=head.next;
            }
        }
        if(oh!=null){
            ot.next=eh;
        }
        else{
            return eh;
        }
        if(eh!=null){
            et.next=null;
        }
        return oh;
    }
    
    
    OR
    
    public static LinkedListNode<Integer> evenAfterOdd(LinkedListNode<Integer> head) {
    LinkedListNode<Integer> head2=evenAfterOdd(head.next);
        LinkedListNode<Integer> temp=head2;
        if(head.data%2==0)
        {   
            if(temp.data%2==0)
            {
                head.next=temp;
                return head;
            }
            while(temp.next!=null && temp.next.data%2!=0)
            {
             temp=temp.next;
            }
            LinkedListNode<Integer> t1=temp.next;
            temp.next=head;
            head.next=t1;
            return head2;
            }
        else 
        {
         head.next=head2;
         return head;
        }
     }