链表所包含的节点结构体由两部分构成：它所持有的数据，以及指向另一个节点结构体(或者是NULL，结束链表)的指针。

A linked list consists of a node structure that contains two members: the data it is holding and a pointer to another node structure (or NULL, to terminate the list).

youdao

由于 NULL 指针会结束一个链表，所以我们也可以使用 NULL 指针条件作为基于链表的很多递归程序的基线条件。

Since a NULL pointer terminates a list, we can also use the NULL pointer condition as a base case for many of our recursive functions on linked lists.

youdao

我们来检查检查，我写了一个小测试脚本，我写这个脚本来测试单元排序，它能够打印出每一轮结束后，链表的是什么样子的。

Let's check it out. I've written a little bit of a test script here, so if we test cell sort, and I've written this so that it's going to print out what the list is at the end of each round, OK.

youdao

Let's check it out. I've written a little bit of a test script here, so if we test cell sort, and I've written this so that it's going to print out what the list is at the end of each round, OK.

我们来检查检查，我写了一个小测试脚本,我写这个脚本来测试单元排序，它能够打印出每一轮结束后,链表的是什么样子的。

麻省理工公开课 - 计算机科学及编程导论课程节选