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

  • swojit
     + 3 comments
    if (headA == null || headB == null) {	
    return (headA == null) ? headB: headA;		
}	
if (headA.data < headB.data) {	
    headA.next = MergeLists(headA.next, headB);			
    return headA;	
}	
headB.next = MergeLists(headB.next, headA);		
return headB;

    Do you think this is a bit simpler? I know it tests twice.

    PS: How to attach code?