For example, linked lists are defined in terms of themselves.
例如，链表就是根据其本身定义出来的。
Let's look at a few examples of recursive functions on linked lists.
让我们来看一些基于链表的递归函数示例。
One advantage of linked lists is that you can use them to avoid locking situations.
链表的优势之一是，您可以使用它们来避免锁定状态。
Although manual memory management with linked lists is possible, it is not a very friendly task.
尽管使用链表人工管理内存是可行的，但那不是一件非常容易的工作。
Singly linked lists are a powerful abstraction that allow you to represent numerous types of data.
单链表是让您可以描述多种类型数据的一种有效抽象。
An abbreviation for the type of immutable singly-linked lists.
不可变单向链接列表的类型的缩写词。
If the two linked lists have no intersection at all, return null.
问题描述：找出两个链表相交的地方。
Their values are stored on singly-linked lists of overflow pages.
它们的值也会存储在溢出页的单项链表上。
You are given two linked lists representing two non-negative numbers.
给定两个链表，分别代表两组非负数字。
It is a dynamic circular chain that formed by sequent lists and linked lists alternately.
该结构是由顺序表与链表交叉构造而形成的一种动态循环链表。
Now that you have a handle on linked lists, you should be aware of a few interesting properties of lists that you will exploit.
既然您已经了解了链表，那么您应该意识到将要使用的列表的一些有趣的属性。
Program using Pointers, linked lists, arrays, structures, and other knowledge, can be applied to a small management software.
程序用了指针、链表、数组、结构体等知识点，可运用于小的管理软件。
The most common use for generic classes is with collections like linked lists, hash tables, stacks, queues, trees, and so on.
泛型类最常用于集合，如链接列表、哈希表、堆栈、队列、树等。
In theory the hash table is a rather simple construct, just collection of arrays or linked lists divided into a finite number of buckets.
理论上，哈希表是一个非常简单的构造，就是数组或链表的集合被划分到有限数量的存储体中。
They can be expressed as ordered vectors, unordered groups, linked lists, trees, graphs or other forms that the programming language supports.
它们可以表示为有序的向量、无序的组、链表、树、图或编程语言支持的其他形式。
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.
由于NULL指针会结束一个链表，所以我们也可以使用 NULL 指针条件作为基于链表的很多递归程序的基线条件。
I won't spend much time analyzing these operations, because my approach to linked lists will be from a different perspective (which I'll explain later).
我不会用太多时间来分析这些操作，因为我的方法是从另一个角度来使用链表(稍后进行解释)。
For example, if it's a console company and they mainly use c, be ready to answer questions on linked lists, memory usage, and other low level questions.
举例来说，如果是一家游戏主机开发公司而他们主要使用C语言，那你就要准备回答链表，内存管理之类底层的问题。
On the basis of class and in accordance with the level structure and the inheritance relation of class, a rule base is constructed by using linked lists.
它以类为基础，并根据类的层次结构和继承关系用链表来构造规则库。
So for example, instead of concurrent linked lists, we use dual concurrent lock circular arrays, so we have the benefits of non blocking concurrency without object creation.
因此，相对于并发链表，我们采用了二重并发锁循环数组（dual concurrent lock circular arrays），这样无需创建对象就能享受到非阻塞并发带来的好处。
So for example, instead of concurrent linked lists, we use dual concurrent lock circular arrays, so we have the benefits of non blocking concurrency without object creation.
因此，相对于并发链表，我们采用了二重并发锁循环数组（dual concurrent lock circular arrays），这样无需创建对象就能享受到非阻塞并发带来的好处。
应用推荐