Iterate through the head1 to find the last node join the next of last node of head1 to the 1 st node of head2
while ( tail != NULL ) { if ( tail -> next == NULL && head2 != NULL ) { tail -> next = * head2 ; break ; } tail = tail -> next ; }