创建并输出一个链表

/*创建节点*/
struct node
{
	int n;
	node *next;
};

/*创建一个链表*/
node *create()
{
	node *p1, *p2,*head;
	head = NULL;
	p1 = p2=(node *)malloc(Len(node));
	head = p1;
	cin >> p1->n;
	while (p1->n != 0)
	{
		p2 = p1;
		p2->next=p1 = (node *)malloc(Len(node));
		cin >> p1->n;
	}
		p2->next = NULL;
		free(p1);
		return head;
}

/*打印链表*/
void display(node *head)
{
	node *p1  = head;
	while (p1 != NULL)
	{
		cout << p1->n << ' ';
		p1 = p1->next;
	}
	cout << endl;
}