完整单链表的建立，输入，输出，转变

#include"iostream.h"
#include"stdlib.h"
typedef int elemtype;
typedef struct londe{
	elemtype data;
    struct londe *next;                    /*指向节点的指针*/
}londe,*linklist;                          /*londe,*linklist是类型名*/
void create(linklist &L){
	int i,j;
	linklist p,q;                          /*指向节点的指针p和q*/
	cout<<"please input the number of node:";
	cin>>i;
	L=p=(linklist)malloc(sizeof(londe));   /*类型转换*/
	for(j=1;j<=i;j++){
		q=(linklist)malloc(sizeof(londe));
		cout<<"please input a data of i="<<j<<":";
		cin>>q->data;
		p->next=q;
		p=p->next;
};q->next=NULL;}
void turnover(linklist L)
{
	linklist p,q;
	q=L->next;L->next=NULL;
	while(q){p=q->next;q->next=L->next;L->next=q;q=p;}
}
void output(linklist &L)
{
	linklist p;
	p=L->next;
	while(p){cout<<p->data<<"->";p=p->next;}
	cout<<endl;}
void main()
{
	linklist L1;                            /*只有四个地址，用来放地址*/
	create(L1);
	output(L1);
	turnover(L1);
	output(L1);
}