您要查找的是不是：
- Problem :Given a singly linked list, find the middle of the list. 单链表上的花样是很多的，很多问题不用些奇淫巧技是不成的。
- If a binary tree becomes degenerate, we run into the same efficiency problems as we did with the singly linked list. 如果二叉树变得很不平衡，我们将会碰到同样的效率问题如同在持久化单向链表是一样。
- Using a singly linked list saves the overhead of updating an additional pointer for all operations as well as the memory for that pointer. 使用单向链接表可省去更新所有操作的附加指针以及该指针的内存的系统开销。
- This one was easy.Simply create a persistent singly linked list and limit insertions and deletions to the head of the list. 让我们插入一个新的节点到这个链表中去，并且该链表是非持久化的，也就是说这个链表可以被改变而无需产生一个新的版本。
- Inserting a new item into a persistent singly linked list will not alter the existing list but create a new version with the item inserted into it. 如果插入一个新的节点到持久化的单向链表中，我们不应该改变当前链表的状态，而需要创建一个新的链表而后插入指定节点。
- Using a singly linked list. 使用单向链接列表实现。
- Singly linked lists are a powerful abstraction that allow you to represent numerous types of data. 单链表是让您可以描述多种类型数据的一种有效抽象。
- How to reverse a singly linked list 如何反转一个单链表
- The Head Node and Singly Linked List 头结点与单链表
- slist : An intrusive singly linked list. 介入式的单链表。
- singly linked list 单向链表
- The data pages are not linked in a linked list. 数据页不在链接列表内链接。
- Represents a doubly linked list. 表示双向链接列表。
- singly linked lists 单链表
- So far, a message queue sounds a lot like a simple linked list. 到目前为止,消息队列听起来很象简单的链表。
- What's the difference between a linked list and an array? 在一个链表和一个阵列之间的差别是什么?
- The program stores birthdate information in a linked list of Client blocks. 程序在Client块的链接表中存储生日信息。
- As an example, take an application that maintains a linked list of accounts. 以维护链接的帐户列表的应用程序为例。
- Assign the expected size of the linked list to the variable expected. 将链接列表的预期大小分配给变量expected。
- I was not saying use black-red tree to implement the hashtable, but use it to replace your linked list. 没有时间去补充数据结构方面的知识，不过还是对你的说法有个疑问。
