链表是一种物理存储单元上非连续、非顺序的存储结构，数据元素的逻辑顺序是通过链表中的指针链接次序实现的。链表由一系列结点（链表中每一个元素称为结点）组成，结点可以在运行时动态生成。每个结点包括两个部分：一个是存储数据元素的数据域，另一个是存储下一个结点地址的指针域。 相比于线性表顺序结构，链表比较方便插入和删除操作。-A linked list is a physical storage unit discontinuous, non-sequential storage structure, the logical sequence of data elements is a pointer to the link list in order to achieve. Linked by a series of nodes (each element in the list called nodes) composed of nodes can be dynamically generated at runtime. Each node consists of two parts: a data field to store data elements, and the other is to store the address of the next node pointer field. Compared to the linear form sequential structure, linked lists more convenient insert and delete operations.