链表的逆置

#include 
using namespace std;
struct Node
{
	Node* link;
	int data;
};

int main()
{
	Node* first = new Node;
	Node* tail = first,*p=NULL,*q=NULL;
	int m = 3;
	while (m != 0)
	{
		p = new Node;
		p->data = m;
		tail->link = p;
		tail = p;
		cin >> m;
	}
	tail->link = NULL;
	first = first->link;
	p = first->link;
	first->link = NULL;
	q = p->link;
	while (q!= NULL)
	{
		p->link = first;
		first = p;
		p = q;
		q = q->link;
	}
	p->link = first;
	first = p;

	while (p != NULL)
	{
		cout << p->data << " ";
		p = p->link;
	}
	return 0;

}