Question

请英语高手翻译一下（1）

List
1, links storage methods
Links to the storage method referred to as linear form List (Linked List).
List the specific storage that is:
① with a group of arbitrary memory cell to store the node linear form (this group of storage units can be continuous, it can also be a discontinuity)
② node in the chain of physical and logical order of priorities are not necessarily the same. To be able to correct that the logic nodes, each node in the storage value at the same time, we must also instructed its subsequent storage node of the address (or location) information (referred to as indicators (pointer) or chain (link))
Note:
Chain Store is the most commonly used method of storage, it said that not only can be used to form linear, but that can be used to all kinds of non-linear structure of the data.
2, the chain node structure
┌ — — ┬ — — ┐
│ data │ next │
└ — — ┴ — — ┘
Data domain - storage node value of the data domain
next domain - storage node of the direct successor to the address (location) indicator domain (domain linked)
Note:
① chain through each node of the domain linked to the linear form of the n nodes according to their links with the logical sequence.
② each node there is only one domain linked the chain known as single chain (Single Linked List).
[Cases] linear form (bat, cat, eat, fat, hat, jat, lat, mat) said that if the single-chain Sketch

3, the first guideline for head and terminal node pointer that domain
List every single node in the storage address is stored in its previous trend next node domain, and begin before becoming a node, it should be established at the beginning of the first indicators head node.
Note:
List beginning the only sure guide, single chain can be the first indicator named after.
[Cases] are the first indicators of the chain might be called the head table head.
No successor node terminal, the terminal node indicator domain is empty, that is NULL.
4, the general-linked list of icons
Since we often focus only on the node logical order, each node do not care about the actual location, you can use arrows to indicate the domain linked indicators, linear form (bat, cat, fat, hat, jat, lat, mat ) Single-chain can be said for the next graphic.

5, single-chain type described
typedef char DataType; / / assume that the data node for the type of character domain
typedef struct node (/ / node type definition
DataType data; / / node of data domain
struct node * next; / / node indicator domain
) ListNode;
typedef ListNode * LinkList;
ListNode * p;
LinkList head;
Note:
① LinkList and ListNode * name is different from the same types of indicators (named for the different concept more clearly)
② LinkList types of indicators that it is variable head the first single-chain indicators
③ ListNode * p variable types of indicators that it is pointing to a node of the indicators

Answer 1

名单
1 ，链接贮存方法
链接到贮藏方法称为线性形式名单（链表） 。
名单上的具体存储是：
①与一组任意的存储单元来存储节点的线性形式（这组存储单位，可以连续，它也可以成为间断）
②节点链中的物理和逻辑的优先次序不一定是相同的。为了能够正确的逻辑节点，每个节点上存储的价值在同一时间内，我们还必须指示其随后的存储节点的地址（或位置）的资料（简称为指标（指针）或连锁（链接） ）
注意：
连锁店是最常用的方法，仓库，它说，不仅可用于线性形式，但可用于各种非线性结构的数据。
2 ，链条节点结构
┌ -- ┬- - ┐
│数据│ │未来
└ -- ┴- - ┘
数据域-存储节点值的数据域
未来域-存储节点的直接的继任者的地址（位置）的指标，网域（域相连）
注意：
①链，通过每个节点域联系在一起的线性形式的N节点根据其联系的逻辑顺序。
②每个节点上只存在一个域的联系链条被称为单链（单链表） 。
[案件]线性表（蝙蝠，猫，吃，脂肪，帽子，李祖泽，拉脱维亚，垫子）说，如果单链示意图

三，第一个纲领性文件头部和终端节点的指针域的
名单上的每一个节点的存储地址是储存在其以往的趋势，明年节点的网域，并开始之前，成为一个节点，它应建立在开始的第一指标，头部节点。
注意：
名单一开始就只知道为指导，单链可以成为第一位的指标，命名为后。
[案件]是第一指标连锁可称为头表头。
没有继任节点码头，该码头节点指标域是空的，这是空。
4 ，一般链表的图示
因为我们往往只集中于节点的逻辑顺序，每个节点不关心的实际位置，您可以使用箭头，以显示域联系在一起的指标，线性形式（蝙蝠，猫，脂肪，帽子，李祖泽，拉脱维亚， MAT ）的单链，可以说是为未来的图形。

5 ，单链型描述
typedef煤焦数据; / /假设的数据节点类型的性格域
typedef结构节点（ / /节点类型的定义
数据资料; / /节点的数据域
结构节点*未来; / /节点指标域
） listnode ;
typedef listnode *链表;
listnode *磷;
链表头;
注意：
①链表和listnode *姓名不同，从同类型的指标（命名为不同的概念更清楚）
②链表类型的指标，它是可变的头部第一单链指标
③ listnode *普变量类型的指标，这是指向一个节点的各项指标