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.
Node*MergeLists(Node*headA,Node*headB){// This is a "method-only" submission. // You only need to complete this method if(headA==NULL&&headB!=NULL)returnheadB;if(headB==NULL&&headA!=NULL)returnheadA;if(headA==NULL&&headB==NULL)returnNULL;if(headA->data<headB->data){headA->next=MergeLists(headA->next,headB);returnheadA;}headB->next=MergeLists(headA,headB->next);returnheadB;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Merge two sorted linked lists
You are viewing a single comment's thread. Return to all comments →
I get inspiration from your answer: