In article <01bb9a43.bb488900$7c024999@user>

Establish a pointer (variable) of the same type as a list node.

Assign the head of the first list to this pointer.

If this pointer is NIL, then there is no first list so you need only
assign the head of the second list to the head of the first list.  

Otherwise, while the "next" node field is not NIL, assign it to the
pointer.

Having reached the last node of the first list ("next" node field is
nil) assign the head of the second list to the "next" node field.

When done, you should probably assign a NIL value to the head of the
second list as it no longer exists as a separate list.

The above outlines a solution to  your problem.  You should be able
to "code" it without too much trouble.  You're goal, however, should
be to produce a reasonable design (outline) from which anyone could
"code" the solution.

have another pointer, point to the previous record.

like
head->next  ( pointer to the next record )
head<-next  ( pointer to the previous record )

by doing this. you can make the beginning of the second list point to the
end of the first list and the end of the second list point to the first

like

first->second
first<-second

----------------------------------------------------------------------
Support Chips.. nothing runs without us