merge linked list

Hello,
I need some help, with the next exercise: I have two simple linked list A and B and i have to create a new one without duplicating the elements, where
C1=A1 -> C2=B1->C3=A2->C4=B2->C5=A3->C6=B3 ... and so on.
I'm still thinking how to relink the elements :thinking:

 

Code:

int i;
int size = A.size(); // given that A and B have equal size

for (i = 0; i < size; i++)
{
    C.push_back(A.at(i));
    C.push_back(B.at(i));
}