您要查找的是不是：
- Generalized Binary Linked List 广义二叉链表
- binary link list structure 二叉链表结构
- For some purposes a binary tree is the best solution, but usually the simpler linked list is the obvious choice. 对于某些情况,二叉树是最佳选择,但在通常情况下,更简单的链表是显而易见的选择。
- The data pages are not linked in a linked list. 数据页不在链接列表内链接。
- Represents a doubly linked list. 表示双向链接列表。
- If a binary tree becomes degenerate, we run into the same efficiency problems as we did with the singly linked list. 如果二叉树变得很不平衡，我们将会碰到同样的效率问题如同在持久化单向链表是一样。
- So far, a message queue sounds a lot like a simple linked list. 到目前为止,消息队列听起来很象简单的链表。
- What's the difference between a linked list and an array? 在一个链表和一个阵列之间的差别是什么?
- Problem :Given a singly linked list, find the middle of the list. 单链表上的花样是很多的，很多问题不用些奇淫巧技是不成的。
- 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。
- The results provides theory basis for knowledge acquisition of information systems and decision table based on general binary relation. 所得结果为在一般二元关系下的信息和决策表的知识获取提供了理论依据。
- An algorithm that traverses a general binary tree will have complexity O( 2 N ). 一个算法，遍历一般二叉树将复杂性为O(2 N)段。
- generalized binary symmetric channel 广义二进制对称信道
- Furthermore, because XER uses XML syntax, it is human-readable, while all other ASN.1 encoding rules generate binary data. 而且虽然ASN.;1编码产生二进制数据的同时，由于XER使用XML语法规则，使得ASN
- Serial number under the CPU and disk serial number to generate machine code, and then encrypted to generate binary serial number. 根据CPU序列号和磁盘序列号生成机器码，然后对机器码进行加密生成序列号。
- I was not saying use black-red tree to implement the hashtable, but use it to replace your linked list. 没有时间去补充数据结构方面的知识，不过还是对你的说法有个疑问。
- Also given is a simple technique to generate binary phase-only filters with CCD camera, PC/XT computer and photographic film. 同时还给出了制作二元纯位相滤波器的简单方法。
- In other words, new items are added to the end, and map lookups move items to the end of the linked list. 换句话说,新项目被添加到尾部,映射表查找操作将项目移到链表的尾部。
