Question: Please answer the question asap and i will surely upvote the answer (DSA Question) Let A and B be two linked lists. Write a function
Please answer the question asap and i will surely upvote the answer (DSA Question)
Let A and B be two linked lists. Write a function to create a new linked list C that contains elements alternative from A to B in reverse order beginning with the last 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. Discuss its time and space complexity
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
