链表是一种物理存储单元上非连续、非顺序的存储结构，数据元素的逻辑顺序是通过链表中的指针链接次序实现的。链表由一系列结点（链表中每一个元素称为结点）组成，结点可以在运行时动态生成。每个结点包括两个部分：一个是存储数据元素的数据域，另一个是存储下一个结点地址的指针域。-The list is a non-contiguous physical memory cell, non-sequential storage structure, logical sequence of data elements through the list of pointers linking order to achieve. It lists a series of nodes (each element in the list known as nodes) composed of nodes can be dynamically generated at runtime. Each node consists of two parts: one is a data field to store data elements, and the other is to store the address of the next node pointer field.