Question: Describe an algorithm for concatenating two singly linked lists L and M, into a single list L that contains all the nodes of L followed
Describe an algorithm for concatenating two singly linked lists L and M, into a single list L that contains all the nodes of L followed by all the nodes of M.
Make sure that your solution should run in linear time. Give Pseudocode.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
