C語言——合併兩個遞增排序鏈表

struct node
{
int num;
struct node *next;
};
typedef struct node Node;
typedef Node * Link;

Link Merge(Link head1, Link head2)
{
If(head1 == NULL)	return head2;
If(head2 == NULL)	return head1;
Link mergedhead = NULL;
if(head1->data < head2->data)
{
mergedhead = head1;
mergedhead->next = Merge(head1->next, head2);
}
else
{
mergedhead = head2;
mergedhead->next = Merge(head1, head2->next);
}
return mergedhead;
}