倒置线性表中数据的顺序（c++）

template<typename E>
void LList<E>::reverse(){
	Link<E> * p,* q;  //Temporary node
	p = head -> next ;
	tail = p;
	head->next = NULL ;
	while( p ) { //Traverse the list until it is empty
		q =p ;
		p = p -> next ;
		q -> next = head -> next ; //insert to the head
		head ->next = q;
	}
}