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

  • thomas_doutre
     + 1 comment

    Simpler:

    if(!headA){return headB;}
if(!headB){return headA;}
    
if(headA->data < headB->data){
    headA->next = MergeLists(headA->next,headB);
    return headA;
}
else{
    headB->next = MergeLists(headA,headB->next);
    return headB;
}

    • moshahmed
       + 0 comments

      Simpler

      Node* MergeLists(Node *a, Node*b) {
    if( !a) return b;
    if( !b) return a;
    if (a->data < b->data) {
        a->next = MergeLists(a->next, b);
        return a;
    } else {
        return MergeLists(b, a);
    } 
}

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in