用递归方法实现两个链表head1和head2各自有序，请把它们合并成一个链表仍然有序。（c/c++）

#include <iostream>

#include <string>

struct Node
{
    int data;
    Node *next;
};

Node* Merge(Node *head1,Node *head2)

{

if (head1==NULL)

return head2;

if (head2==NULL)

return head1;

Node *head=NULL;

if(head1->data<head2->data)

{

head=head1;

head->next= Merge (head1->next,head2);

}

else

{

head=head2;

head->next=Merge(head1,head2->next);

}

return head;

}