单链表的逆转

typedef struct LNode *Ptr;  
struct LNode{
ElementType Data;
List Next;
};
Ptr head,new,old,tmp;
Ptr Reverse(Ptr head,int K)//链表的逆转伪代码 
{
	cnt=1;
	new=head->Next; 
	old=new->Next;
	while(cnt<K){
		tmp=old->Next;
		old->Next=new;
		new=old;old=tmp;
		cnt++;
	}
	head->Next->Next=old;
	return new;
}