Merge two sorted linked lists
Merge two sorted linked lists into one sorted list and return its head, reusing the existing nodes. Do it iteratively with a dummy head, then discuss the recursive version.
No answer yet. Write the first one; the best answer gets endorsed.