#include<stdio.h>

#include<stdlib.h>

#define N 9

typedef struct node{

int data;

struct node * next;

}ElemSN;

ElemSN * Createlink(int a[],int n){ //逆向创建单向链表

int i;

ElemSN * h=NULL, * p;

for( i=N-1;i>=0;i--){

p=(ElemSN *)malloc(sizeof(ElemSN));

p->data =a[i];

p->next=h;

h=p;

}

return h;

}


PrePrintlink(ElemSN*h){

int a[N],top = -1; //辅助栈 先进后出

ElemSN * p;

for(p=h;p;p=p->next){

a[++top] = p->data; //压栈

}

while(top!=-1){

printf("%5d",a[top--]);//出栈

}

}


int main(void){

int a[N]={1,2,3,4,5,6,7,8,9};

ElemSN * head;

head=Createlink(a,9);

PrePrintlink(head);

}