数据结构实验之链表一：顺序建立链表

#include
#include
struct node
{
    int data;
    struct node *next;
};
int main()
{
    int i,n;
    struct node *head,*p,*tail;
    head=(struct node*)malloc(sizeof(struct node));
    head->next=NULL;
    tail=head;
    scanf("%d",&n);
    for(i=0;i     {
        p=(struct node*)malloc(sizeof(struct node));
        scanf("%d",&p->data);
        p->next=NULL;
        tail->next=p;
        tail=p;
    }
    p=head;
    while(p->next!=NULL)
    {
        printf("%d ",p->next->data);
        p=p->next;
    }
    return 0;
}