//函数:合并两个已排序的链表(递归方法实现) link_list_t merge_linklist_recursive(link_list_t head1,link_list_t head2){ if(NULL == head1) return head2; else if(NULL == head2) return head1; link_list_t merge_head = NULL; if(head1->m_val < head2->m_val){ merge_head = head1; merge_head->next = merge_linklist_recursive(head1->next,head2); } else{ merge_head = head2; merge_head->next = merge_linklist_recursive(head1,head2->next); } return merge_head; }