DS-(I) Assignment 6: Linked List Applications

 

Set A.

1)Write a program that merges two ordered linked lists into third new list. When two lists are merged the data in the resulting list are also ordered. The two original lists should be left unchanged. That is merged list should be new one. Use linked implementation.

 

2)Write a program that adds two single variable polynomials. Each polynomial should be represented as a list with linked list implementation.

 

Set B.

1)Write a program that sorts the elements of linked list using any of sorting technique.

 

2)Write a program that multiply two single variable polynomials. Each polynomial should be represented as a list with linked list implementation.