Merge two sorted lists

Title: Enter two incrementally sorted lists, merge the two linked lists, and make the nodes in the new list continue to be sorted in ascending order. The linked list node is defined as follows:

struct listnode{int m_nvalue;int m_pnext;};

As shown, at a glance, compare the head nodes of the two lists, and the smaller values are incorporated into the new nodes, so that loops can be solved by recursion.

Use recursive ListNode *merge (ListNode *phead1, ListNode *phead2) {if (phead1==null)    return Phead2;else if (phead2==null) Return phead1;//the head pointer of the new list ListNode *pnewhead=null;if (phead1->m_nvalue<phead2->m_nvalue) {pNewHead=phead1; Pnewhead->m_pnext=merge (phead1->m_pnext,phead2);} else{pnewhead=phead2;        Pnewhead->m_pnext=merge (Phead1,phead2->m_pnext);} return pnewhead;}

Merge two sorted lists