The first line of input contains an integer 'T' representing the number of Test cases. The next '2*T' lines denote the 'T' test cases. Each test case consists of two lines. The first line of each test case contains the first linked list separated by space and terminated by -1. The second line of each test case contains a second linked list separated by space and terminated by -1.
For each test case, print two lines denoting a single space-separated modified linked list by interweaving alternate nodes of the two linked lists. The output of each test case will be printed in a separate line.
You don't need to print anything. It has already been taken care of. Just implement the given function. The return type is a vector/list of Node*, hence you need to push the head of the first and then second modified linked lists and return the vector/list.
1 <= T <= 10 0 <= N1 <= 10^4 0 <= N2 <= 10^4 -10^9 <= data <= 10^9 and data != -1 Time Limit : 1 sec
Deletion In Doubly Linked List
Insertion In Doubly Linked List
Delete Nodes On Regular Intervals
Add One To Linked List