/*//描述：用尾插法新建链表和输出建好的链表//*/#include 
     
      #include 
      
       #define LEN sizeof(struct Student)typedef struct Student{    char data;    struct Student * next;}stu;//尾插法新建链表stu * create(){    stu * head,*p1,*p2;    char ch;    head = NULL;    p2 = NULL;    printf("请依次输入字符数据('#'表示输入结束):\n");    ch=getchar();    while(ch!='#')    {        p1=(stu *)malloc(LEN);        p1->data=ch;        if(head == NULL)//先判断输入的是不是第一个节点        {            head=p1;        }        else        {            p2->next=p1;//p2始终指向输入的最后一个节点        }        p2=p1;        ch=getchar();    }    p2->next=NULL;    return head;}void show(stu *head){    stu *p1;    p1=head;    while(p1!=NULL)    {        printf("%c",p1->data);        p1=p1->next;    }}void main(){    stu *head;    head = create();    show(head);    getchar();    getchar();}