数据库课程设计代码 实现将一个单链升序和一个单链降序合并为单链升序的算法

#include "stdafx.h"
#include"stdlib.h"
 
   #define OK  1
   #define ERROR 0
   #define OVERFLOW -2


   typedef int ElemType ;
   typedef int Void;

   typedef struct LNode
   {
     ElemType  data;
    struct LNode *next;
   }LNode, *LinkList;


   Void Converse(LNode *head)         //就地逆置
   {
   LNode *p,*q;
   p=head->next;
   head->next=NULL;
   while(p!=NULL)
   {
   q=p;
   p=p->next;
   q->next=head->next;
   head->next=q;
   }