#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,* tail, * p;
for( i=0;i<N;i++){
p=(ElemSN *)malloc(sizeof(ElemSN));
p->data =a[i];
p->next=NULL;
if(!h)
h=tail=p;
else
tail=tail->next=p;
}
return h;
}
PrePrintlink(ElemSN*h){
ElemSN * Pend=NULL;
ElemSN * p;
while(Pend-h){
for(p=h;p->next-Pend;p=p->next );
printf("%2d\n",p->data );
Pend=p; //pend为哨兵,标志的位置都为上次遍历停止的位置,停止就输出当前node的data
}
}
int main(void){
int a[N]={1,2,3,4,5,6,7,8,9};
ElemSN * head;
head=Createlink(a,9);
PrePrintlink(head);
}
原文地址:http://blog.51cto.com/13645380/2153434
时间: 2024-09-30 20:40:38