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

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

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

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

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

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

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

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

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

相反，他们可以使用链表的抽象，看起来像这样，更容易概念化。

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

只需稍作改动，我们就可以将链表用作堆栈，即 LIFO… … 后进先出。

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

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

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

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

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 处的另一个节点。

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.

由于这种灵活性，许多更复杂的数据结构都建立在链表之上，最著名和最普遍的是队列和堆栈。

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.

所以这个链表恰好是循环的，但它也可以通过使用 next 指针值 0——空值——来终止，这表明我们已经到达了链表的末尾。

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.

如果我们想将某人入队，也就是将他们添加到行中，我们必须向下遍历链表直到到达末尾，然后将 next 指针更改为指向新人。