/swap--concatinate-and-add-two-infinity-number-of-linked-list

a). Write a program to concatenate two un-ordered doubly linked lists into one. The input and output of the program is shown as follows b). Modify the program in (a) to combine two ordered doubly linked lists resulting in single ordered doubly linked lists. The output of the program is shown as follows c). using doubly linked list. Write a function that returns the sum of these two lists. The sum list is linked list representation of the addition of two input numbers. There are two restrictions to solve this problem i.e. you cannot modify the lists and you are not allowed to use explicit extra space (Resultant list is not explicit) Is it easy to implement? or more difficult?

Primary LanguageC++

swap, concatinate and add two infinity number of linked list