We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Merge two sorted linked lists
  5. Discussions

Merge two sorted linked lists

  • hooni
     + 0 comments

    nice solution.

    The latter part of the code can be slightly shortened:

    if(headA.data >= headB.data) {
        Node temp = headB;
        headB = headB.next;
        temp.next = headA;
        headA = temp;
    }
    headA.next = mergeLists(headA.next,headB);
    return headA;