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

  • J_Stolzenwald
     + 0 comments

    much shorter version:

    // handle end of list
if(head1 == NULL){
    return head2;
}
if(head2 == NULL){
    return head1;
}

// handle sorting
if(head1->data < head2->data){
    head1->next = mergeLists(head1->next, head2);
    return head1;
}
head2->next = mergeLists(head1, head2->next);
return head2;