Let P be of type of linked list.

b) Let P be of type of linked list. Write a ‘C’ function split to create two linked lists Q & R. Q contains all elements in odd positions of P and R contains the remaining elements. Your function should not change list P. What is the complexity of your program?

Leave a Reply