c--数据结构--双链表

#include "stdio.h"
#define TYPE struct student
#define LEN sizeof(TYPE)
#define NULL 0
struct student{
    int no;
    TYPE *next;
    TYPE *pre;
};
TYPE *create2List(int n) {
    TYPE *header,*ps,*p;
    int i;
    for(i=1;i<=n;i++) {
        p=(TYPE *)malloc(LEN);
        printf("please input the no:");
        scanf("%d",p->no);
        if(i==1){
            header=ps=p;
        }
            p->pre=ps;
            ps->next=p;
            ps=p;
            ps->next=NULL;

    }
    return header;
}

int getLength(TYPE *list) {
    TYPE *ps;
    int i=0;
    ps=list;
    while(ps!=NULL) {
        i++;
        ps=ps->next;
    }
    return i;
}
main() {
   printf("%d",getLength(create2List(4)));
   getch();
}