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

  • Vivic
     + 0 comments

    We can simplify your solution even furthur. The following is almost the same but appeared easier to understand to me. Actually the else block is simplified.

    if((headA==null)&&(headB==null)) return null; if((headA!=null)&&(headB==null)) return headA; if((headA == null)&&(headB!=null)) return headB;

    if(headA.data<headB.data){
    headA.next = mergeLists(headA.next, headB);
    return headA;
} else{
     headB.next = mergeLists(headA, headB.next);
    return headB;
}