10.3在表尾插入生成单链表

//10.3在表尾插入生成单链表
#include <stdio.h>
#include <stdlib.h>

typedef struct node
{
	char data;                 //data 为节点的数据域
	struct node *next;         //next 为节点的指针域
}LNode;                        // 单链表节点类型

LNode * CreateLinkList()       //在表尾生成单链表
{
	LNode *head, *p, *q;
	char x;
	head = (LNode *)malloc(sizeof(LNode));
	p = head;
	q = p;
	printf("Input any char string:\n");
	scanf("%c", &x);
	while (x != '\n')
	{
		p = (LNode *)malloc(sizeof(LNode));
		p->data = x;
		p->next = NULL;
		q->next = p;
		q = p;
		scanf("%c", &x);
	}
	return head;
}

int main()
{
	LNode *h, *p;
	h = CreateLinkList();
	p = h->next;
	while (p != NULL)
	{
		printf("%c, ", p->data);
		p = p->next;
	}
	printf("\n");

	return 0;
}