singly-linked

基本解释

Problem :Given a singly linked list, find the middle of the list.
单链表上的花样是很多的，很多问题不用些奇淫巧技是不成的。
Singly linked lists are a powerful abstraction that allow you to represent numerous types of data.
单链表是让您可以描述多种类型数据的一种有效抽象。
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.
让我们插入一个新的节点到这个链表中去，并且该链表是非持久化的，也就是说这个链表可以被改变而无需产生一个新的版本。