529 Program

the new list alternate between these two nodes of the original.
tq

I guess you already have a "Node struct a LinkedList" struct "(or something that holds a pointer to the head of the list as in:" node * head; ") and you already have a method that may add or delete entire list.

Then you'll need to write a new function Add (...) that takes a linked list as argument and for each item in this list, add it to your existing list (until zero is reached, which means that the end of the list has been reached).

Adding a new (...) method can take in the head "pointer of the second list and use your current method add-whole-of-list.

It would be easier if you had a bit of code. Write some and we'll help.