View the step-by-step solution to:


How to merge two sorted linked lists, and return it as a new list? The new list should be made by splicing

together the nodes of the first two lists.

For example: Input: 1 → 2 → 5, 3 → 6. Output: 1 → 2 → 3 → 5 → 6.

Please implement and answer in pseudo code for function Merge-Two(l1, l2). Type of l1 and l2 are ListNode.

Top Answer

Sign up to view the full answer

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.


Educational Resources
  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question