数据结构：打印简单的链表

打印简单的链表

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

struct node;
typedef struct node *PtrToNode;
typedef PtrToNode List;
typedef PtrToNode Position;

struct node{
    int element;
    struct  node * Next;
};

List createList(){
    List L;
    L = (List)malloc(sizeof(PtrToNode));
    L->Next = NULL;
    return L;
}

int isEmpty(List L){
    return L->Next == NULL ;
}

void Push(List L,int n){
    Position TempCell;
    TempCell = (List)malloc(sizeof(PtrToNode));
    TempCell->element = n;
    TempCell->Next = L->Next;
    L->Next = TempCell;
}

void printList(List L){
    if(!isEmpty(L)){
        Position p;
        p = L->Next;
        while(p!=NULL){
            printf("%-2d",p->element);
            p = p->Next;
        }
    }
}

List newList(){
    int i;
    List L;
    L = createList();
    for(i=0;i<10;i++){
        Push(L,i);
    }

    return L;
}

int main(){

    printList(newList());
}