Perhaps you're right, but I think the story is out of date. No one keeps a watch on a chain any more.

也许你是对的，但我觉得这个故事过时了，没有人还留着链表了。

So I guarantee you, everybody who raised their hand, they have done what's called a singly-linked list.

我敢保证，刚刚举手的每一位，肯定做过单向链表。

Linked Lists can also easily be re-ordered, trimmed, split, reversed, and so on.

链表也可以很容易地重新排序、裁剪、分割、转等。

And the teacher that was teaching, Ray Babcock, he was talking about linked lists.

授课的老师是雷·巴布科克，当时正在讲解链表。

A node in a linked list doesn't know anything about the world it's in.

链表中的节点对其所在的界一无所知。

So this linked list happened to be circular, but it could also have been terminated by using a next pointer value of 0 -- the null value -- which would indicate we've reached the end of the list.

所以这个链表碰巧是循环的，但也可能通过将下一个指针值设为0——即空值——来表示我们已经到达了链表的末尾。

This was after the linked list and I cannot figure out recursion.

这是在学习了链表之后，但我还是无法理解递归。

Instead, they can use an abstraction of a linked list, that looks like this, which is much easier to conceptualize.

，们可以使用一个链表的抽象形式，看起来像这样，这要容易理解得多。

Now you have to learn Java at Montana State University when I went, and so He's off there kind of explaining this whole linked list thing and all that.

现在你在蒙大拿州立大学学习时必须要学Java，所以我去的时候， 就在那里解释链表的整个概念等等。

Using this struct, we can create a linked list, which is a flexible data structure that can store many nodes.

使用这个结构体，我们可以创建一个链表，这是一种灵活的数据结构，可以存储许多节点。

Yeah, let's wax philosophical about a linked list.

好吧，让我们来谈谈链表的哲学意义。

With just a small change, we can use linked lists as stacks, which are LIFO… Last-In First-Out.

只需稍作改动，我们就可以将链表用作栈，也就是后进先出（LIFO）。

Owing to this flexibility, many more-complex data structures are built on top of linked lists The most famous and universal are queues and stacks.

由于这种灵活性，许多更复杂的数据结构都是基于链表构建的。最着名和通用的是队列和栈。

You can even have tree nodes that use linked lists to store all the nodes they point to.

你可以让树的节点使用链表来存储它们指向的所有节点。

Looking down the linked list, to the next node, we see it stores the value 112 and points to another node at location 1002.

遍历链表，到下一个节点，我们看到它存储的值是112，并指向位置1002的另一个节点。

This means that the next node in the linked list is located at memory location 1008.

这意味着链表中的下一个节点位于内存位置1008。

If we want to enqueue someone, that is, add them to the line, we have to traverse down the linked list until we hit the end, and then change that next pointer to point to the new person.

如果我们想让某人加入队列，也就是让们排到队伍的末尾，我们需要遍历链表直到末尾，然后修改那个指向下一个节点的指针，使其指向新加入的人。

Unlike an array, whose size has to be pre-defined, linked lists can be dynamically extended or shortened.

与数组不同，数组的大小必须预先定义，而链表可以动态扩展或缩短。

Imagine we have a pointer, named " post office queue" , that points to the first node in our linked list.

想象我们有一个指针，名为“邮局队列”，它指向我们的链表中的第一个节点。

When programmers use linked lists, they rarely look at the memory values stored in the next pointers.

当程序员使用链表时，们很少会查看存储在下一个指针中的内存值。