数据结构=。= 链表

typedef struct  Data //Data数据结构
{
    char key[10]; //关键字
    char name[20]; //
    int age;      
}

typedef struct Node //结点结构
{
    Data nodeData;
    struct Node * next;
}ListNode;

ListNode *addEnd(ListNode *head,Data nodedata)
{
    ListNode *node,*htemp;
    if(!(node = (ListNode*)malloc(sizeof(ListNode))))
    {
        printf("申请内存失败！\n");
        return NULL;
    }
    else
    {
        node->nodeData = nodeData;
        node->next = NULL;
        if(head == NULL)
        {
            head = node;
            return head;
        }
        htemp = head;
        while(htemp->next != NULL)
        {
            htemp = htemp->next;
        }
        htemp->next = node;
        return head;
    }

}

node->nodeData = nodeData;
node->next = head;
head = node;