您要查找的是不是:
- The data pages are not linked in a linked list. 数据页不在链接列表内链接。
- Represents a doubly linked list. 表示双向链接列表。
- Donald Knuth thoroughly describes linked lists and their operations in. 中详尽地描述了链表及其操作。
- 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。
- It is a dynamic circular chain that formed by sequent lists and linked lists alternately. 该结构是由顺序表与链表交叉构造而形成的一种动态循环链表 .
- Singly linked lists are a powerful abstraction that allow you to represent numerous types of data. 单链表是让您可以描述多种类型数据的一种有效抽象。
- Stacks, queues, linked lists, and trees; algorithms for search, sorting, graph problems are also covered. 这些项目中涉及数组,堆栈,排列,链表和树;查询的运算法则,排序,曲线图问题。
- Although manual memory management with linked lists is possible, it is not a very friendly task. 尽管使用链表人工管理内存是可行的,但那不是一件非常容易的工作。
- Existing components are: Linked lists; Hash tables with optional auto-resize; Memory-efficient sparse matrices built on hash tables; Red-black trees. 现有组件包括:链表、希表(选自动调整大小)建立在哈希表基础上的有效内存稀疏基、-黑树。
- They can be expressed as ordered vectors, unordered groups, linked lists, trees, graphs or other forms that the programming language supports. 它们可以表示为有序的向量、无序的组、链表、树、图或编程语言支持的其他形式。
- In computing, some of the most common organizations are linked lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, and graphs. 在计算机技术中,一些最常用的组织方式是链接表、堆栈、队列、集合、哈希表、树、堆、优先队列和图。
- I was not saying use black-red tree to implement the hashtable, but use it to replace your linked list. 没有时间去补充数据结构方面的知识,不过还是对你的说法有个疑问。
- To start with, the standard A* algorithm uses a sorted linked list (or two linked lists) to track nodes that are checked. 标准A*算法使用一个(或者两个)排序的列表来纪录检查过的节点。
- In other words, new items are added to the end, and map lookups move items to the end of the linked list. 换句话说,新项目被添加到尾部,映射表查找操作将项目移到链表的尾部。
- A student achievement management system, uses linked list for data inserting, deleting, sorting and querying, C-C. 学生成绩管理系统,应用链表实现对数据的插入,删除,查找,排序。