顺序建表

# include  <stdio.h>
# include <stdlib.h>
typedef int Elem ;
typedef struct node{
     Elem data;
     struct node *next;
} Node;
Node *create_linkedlist(int n);
void show(Node *head);
int main()
{
     int n;
     scanf("%d",&n);
     Node *head;
     head = create_linkedlist(n);
     show(head);
     return 0;
}


Node *create_linkedlist(int n)
{
     Node *head;
     Node *tail;
     Node *p;
     Elem key;
     head = (Node*)malloc(sizeof(Node));
     tail = head;
     while(n--)
     {
          scanf("%d",&key);
          p = (Node*)malloc(sizeof(Node));
          p->data = key;
          tail->next = p;
          //p->next = NULL;
          tail = p;
}
      tail->next = NULL;
      return head;
}
void show(Node *head)
{
      Node *p;
      p = head->next;
     while(p)
     {
       printf("%d ",p->data);
       p = p->next;
      }
}