c/c++链表的实现

 #include<iostream>
 #include<string>
 #define SIZE 3
 using std::cout;
 using std::endl;
 using std::string;

 class MyClass{
 public:
     struct DataInfo{
         int age;
         string name;
     };
 private:
     struct Queue{
         DataInfo  dataInfo;
         Queue *front;
         Queue *next;
     };
 private:
     Queue  *head, *tail;

 public:
     inline Queue* CreateNode()
     {
         Queue *node;
         node = new Queue;
         return node;
     }
     inline void InsertNode(DataInfo dataInfo)//采用头插法
     {
         Queue *pNode;
         pNode = CreateNode();
         pNode->dataInfo = dataInfo;
         pNode->next = head->next;
         head->next->front = pNode;
         head->next = pNode;
         pNode->front = head;
     }
     inline void DeleteNode()//采用头删法
     {
         Queue *pNode;
         pNode = head->next;
         head->next = pNode->next;
         pNode->next->front = head;

     }
     inline void InitinalQueue()
     {
         head = CreateNode();
         tail = CreateNode();
         head->next = tail;
         head->front = NULL;
         tail->front = head;
         tail->next = NULL;
     }
     inline void OutputQueue()
     {
         Queue *pNode;
         pNode = head->next;
         do{
             cout << pNode->dataInfo.age <<" "<< pNode->dataInfo.name << endl;
             pNode = pNode->next;
         } while (pNode!=tail);
     }
     inline void  FreeSpace()//释放空间
     {
         Queue *pNode;
         pNode = head->next;
         while (pNode != NULL)
         {
             delete pNode->front;
             pNode = pNode->next;
         }
         delete tail;
     }
 };
 void  main()
 {
     MyClass myClass;
     myClass.InitinalQueue();
     MyClass::DataInfo  dataInfo[SIZE];
     dataInfo[].age = ;
     dataInfo[].name = "436酱油哥";

     dataInfo[].age = ;
     dataInfo[].name = "436酱油哥";

     dataInfo[].age = ;
     dataInfo[].name = "436酱油哥";

     myClass.InsertNode(dataInfo[]);
     myClass.InsertNode(dataInfo[]);
     myClass.InsertNode(dataInfo[]);

     myClass.OutputQueue();
     myClass.FreeSpace();//释放new 占用的空间

     system("pause");
 }

链表是非常重要的 我们经常会用到，所以熟练的掌握有助实现！

链表使用的自我理解概念：

链表在物理地址逻辑相邻物理不相邻，有单链表，循环链表，双向链表，实现起来大同小异，主要是熟练掌握指针的使用。链表的节点数据部分可以是变量，数组，结构体，容器等。