Let A and B be two structures of type Linked List.

a) Let A and B be two structures of type Linked List. Write a ‘C’ function to create a new
Linked List C that contains elements alternately from A and B beginning with the first
element of A. If you run out of elements in one of the lists, then append the remaining
elements of the other list to C.

Leave a Reply