九度oj 题目1181：遍历链表

#include <iostream>
#include <cstdio>
#include <cstdlib>

using namespace std;

typedef struct node{
    int data;
    struct node* next;
} LinkNode, *LinkList;
        
void traversal(LinkList L){
     LinkNode* tmp = L->next;
     if(tmp != NULL)
            printf("%d", tmp->data);
     tmp = tmp->next;
     while(tmp != NULL){
               printf(" %d", tmp->data);
               tmp = tmp->next;
     }
     printf("\n");
 }

void creat(LinkList &L, int data){
     LinkNode* temp = (LinkNode*)malloc(sizeof(LinkNode));
     temp->data = data;
     temp->next = NULL;
     if(L->next == NULL){
         L->next = temp;
         return;
     }
     LinkNode* cur = L->next, *pre = L;
     while(cur && cur->data < temp->data){
    pre = cur;
         cur = cur->next;
     }
     if(cur == NULL){
         temp->next = cur;
         pre->next = temp;
     } else {
         temp->next = cur;
         pre->next = temp;
     }
     return;
 }

 int main(){
     int n, i, num;
     while(scanf("%d", &n) != EOF){
         LinkList L;
     L->next = NULL;
         for(i = 0; i < n; i++){
             scanf("%d", &num);    
             creat(L, num);
         }
         traversal(L);
     }
     return 0;
 }