链表

#include <iostream>
#include <cstring>
using namespace std;
struct DATA
{
    int id;
    char name[20];
};

struct Node
{
    DATA data;
    struct Node* next;
};
Node* Create(Node** head)
{
    if(head == NULL)
    {
        return false;
    }
    *head = new Node;
    (*head)->next=nullptr;
    if(*head == nullptr)
    {
         return false;
    }
    return *head;
}
bool Insert(Node* head,DATA data)
{
    if(nullptr == head)
    {
        return false;
    }
    Node *p = new Node;
    if(nullptr == p)
    {
        return false;
    }
    p->next = nullptr;

    while(head->next!=nullptr)
    {
        head = head->next;
    }
    p->data = data;

    p->next = head->next;
    head->next=p;
    return true;
}
bool show(Node* head)
{
    if(nullptr == head)
    {
        return false;
    }
    Node *tmp =head->next;
    while(tmp)
    {
        cout<<"id:"<<tmp->data.id<<endl;
        cout<<"name:"<<tmp->data.name<<endl;
        tmp = tmp->next;
    }
}

int main(int argc, char *argv[])
{
    Node* head =nullptr;
    Create(&head);
    if(nullptr!=head)
    {
        cout<<"链表创建成功"<<endl;
    }
    DATA d1={1,"xiaoming"};
    DATA d2={2,"xiaohong"};
    cout<<d1.name<<endl;
    Insert(head,d1);
    Insert(head,d2);
    show(head);
    return 0;
}