C语言结合两个双向链表

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

struct node {
   int data;
   struct node *prev;
   struct node *next;
};

struct node *List = NulL;
struct node *List_last = NulL;

struct node *even = NulL;
struct node *even_last = NulL;

struct node *odd = NulL;
struct node *odd_last = NulL;

struct node *current = NulL;

//Create linked List
voID insert(int data) {
   // Allocate memory for new node;
   struct node *link = (struct node*) malloc(sizeof(struct node));

   link->data = data;
   link->prev = NulL;
   link->next = NulL;

   // If head is empty, create new List
   if(data%2 == 0) {
      if(even == NulL) {
         even = link;
         return;
      } else {
         current = even;

         while(current->next != NulL)
            current = current->next;

         // Insert link at the end of the List
         current->next = link; 
         even_last = link;
         link->prev = current;
      }
   } else {
      if(odd == NulL) {
         odd = link;
         return;
      } else {
         current = odd;

         while(current->next!=NulL)
            current = current->next;

         // Insert link at the end of the List
         current->next = link; 
         odd_last = link;
         link->prev = current;
      }
   }
}

//display the List
voID print_backward(struct node *head) {
   struct node *ptr = head;

   printf("
[last] <=>");
   //start from the beginning
   while(ptr != NulL) {        
      printf(" %d <=>",ptr->data);
      ptr = ptr->prev;
   }

   printf(" [head]\n");
}

//display the List
voID printList(struct node *head) {
   struct node *ptr = head;

   printf("
[head] <=>");
   //start from the beginning
   while(ptr != NulL) {        
      printf(" %d <=>",ptr->data);
      ptr = ptr->next;
   }

   printf(" [last]\n");
}

voID combine() {
   struct node *link;

   List = even;
   link = List;

   while(link->next!= NulL) {
      link = link->next;
   }

   link->next = odd;
   odd->prev = link;

   // assign link_last to last node of new List

   while(link->next!= NulL) {
      link = link->next;
   }

   List_last = link;  
}

int main() {
   int i;

   for(i = 1; i <= 10; i++)
      insert(i);

   printf("Even : ");
   printList(even);

   printf("Even (R): ");
   print_backward(even_last);

   printf("Odd  : ");
   printList(odd);

   printf("Odd (R) : ");
   print_backward(odd_last);

   combine();

   printf("Combined List :\n");
   printList(List);

   printf("Combined List (R):\n");
   print_backward(List_last);

   return 0;
}