合并两个排序列表

合并两个增序链表，并使之仍然按增序排列；用递归实现；

ListnNode *Merge(ListnNode * pHead1,ListnNode * pHead2)
{
      if(pHead1==NULL)
       return pHead2;
      if(pHead2==NULL)
       return pHead1;

      ListnNode * NewMerge=NULL;
      if(pHead1->m_Value<pHead2->m_Value)
      {
                NewMerge=pHead1;
                NewMerge->m_Next=Merge(pHead1->m_Next,pHead2);
       }
      else
       {
               NewMerge=pHead2;
               NewMerge->m_Next=Merge(pHead1,pHead2->m_Next);
        }
      return NewMerge;
}