Споj листи наизменично

import java.util.Scanner;

public class SpoiListi {
    public static void spoi(DLL<Integer> list1, DLL<Integer> list2){
        DLL<Integer> result=new DLL<>();

        DLLNode<Integer> tmp1=list1.getFirst();
        DLLNode<Integer> tmp2=list2.getLast();

        while(tmp1!=null && tmp2!=null){
            if(tmp1.element%2==0){
                result.insertLast(tmp1.element);
            }
            tmp1=tmp1.succ;

            if(tmp2.element%2==0){
                result.insertLast(tmp2.element);
            }
            tmp2=tmp2.pred;
        }

        if(tmp1!=null){
            while(tmp1!=null){
                if(tmp1.element%2==0)
                    result.insertLast(tmp1.element);
                tmp1=tmp1.succ;
            }
        }
        if(tmp2!=null){
            while(tmp2!=null){
                if(tmp2.element%2==0)
                    result.insertLast(tmp2.element);
                tmp2=tmp2.pred;
            }
        }
        tmp1=list1.getFirst();
        tmp2=list2.getLast();
            while(tmp1!=null){
                if(tmp1.element%2!=0)
                    result.insertLast(tmp1.element);
                tmp1=tmp1.succ;
            }

            while(tmp2!=null){
                if(tmp2.element%2!=0)
                    result.insertLast(tmp2.element);
                tmp2=tmp2.pred;

        }


        System.out.println(result);
    }
    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        DLL<Integer> list1=new DLL<>();
        int n1=in.nextInt();
        for(int i=0;i<n1;i++){
            list1.insertLast(in.nextInt());
        }

        int n2=in.nextInt();
        DLL<Integer> list2=new DLL<>();
        for(int i=0;i<n2;i++){
            list2.insertLast(in.nextInt());
        }
        spoi(list1,list2);
    }
}