单链表的实现与操作

#include <stdio.h>
#include <stdlib.h>

typedef struct list{
    int data;
    struct list* pnext;
}list,*pnode;

pnode create_list();
void traversal_list(pnode phead);

int main()
{
    pnode phead = create_list();
    traversal_list(phead);
    return 0;
}

pnode create_list(){
    int i,n=1;
    puts("please input the number of data:");
    scanf("%d",&i);

    pnode phead = (pnode)malloc(sizeof(list));
    pnode p = phead;

    for(;i>0;i--){
        int idata;
        printf("please input the %dst data:   ",n++);
        pnode pnew = (pnode)malloc(sizeof(list));
        scanf("%d",&idata);

        pnew->data = idata;
        p->pnext = pnew;
        pnew->pnext = NULL;
        p = p->pnext;

    }
    return phead;
}

void traversal_list(pnode phead){
    pnode p = phead->pnext;
    while(p){
        printf("%d",p->data);
        p = p->pnext;
    }
}

转载于:https://www.cnblogs.com/fisher2010/archive/2012/05/01/2477795.html