对于设计级别的类（诸如树、堆栈、队列、集合等等）可以在后面的阶段完成（如设计阶段）。
The identification of design-level classes (e.g., trees, stacks, queues, collections, etc.) should be deferred to a later discipline (i.e. design).
单击jmsdemo队列管理器旁边的加号(+)，以展开文件夹树，然后单击Queues文件夹。
Click the plus sign next to the JMSDEMO queue manager to expand the folder tree, and then click on the Queues folder.
找到从最新的顶点到其他顶点的所有边，这些顶点不能在树的集合中。把这些边加入优先级队列。
Find all the edges from the newest vertex to other vertices that aren't in the tree. Put these edges in the priority queue.
首先，我们介绍红黑树(red - black tree)技术以显示本文中消息队列框架的内部操作。
First, we'll introduce red-black tree technology to show the internal operations of the message queue framework in this article.
但是与之前的Linux调度器不同，它没有将任务维护在运行队列中，CFS维护了一个以时间为顺序的红黑树(参见图1)。
But rather than maintain the tasks in a run queue, as has been done in prior Linux schedulers, the CFS maintains a time-ordered red-black tree (see Figure 1).
这样做了以后，要使优先级队列中在任意时刻只保持一条从树中顶点到某边缘点的边就变得容易了。
As it turns out, it is easier to keep only one edge from the tree to a given fringe vertex in the priority queue at any given time.
每次向树中添加顶点后，都要遍历优先级队列查找并删除这样的边。
We could go through the queue looking for and removing any such edges each time we added a new vertex to the tree.
在程序的算法中，也要确保优先级队列中不能有连接已在树中的顶点的边。
In a programming algorithm we must likewise make sure that we don't have any edges in the priority queue that lead to vertices that are already in the tree.
此平台采用分布式消息路径选择算法生成消息交换路径树，便于XML消息引擎生成一个队列和路由策略。
The M-Commerce platform USES a message path finding algorithm to create a message queue in XML message engine for routing.
泛型类最常用于集合，如链接列表、哈希表、堆栈、队列、树等。
The most common use for generic classes is with collections like linked lists, hash tables, stacks, queues, trees, and so on.
内容包括：数组、链接表、栈和队列、递归、树与森林、图、排序、检索和散列结构等。
The contents are included as follows: Array, Linked List, Stack and Queue, Recursion, Tree and Forest, Graph, Sorting, Indexing and Hashing Structure, etc.
主要包括的内容有：线性表，栈与队列，字符串，二叉树，树，图。
We will introduce Linear Lists, Stacks, Queues, Strings, Binary Trees, Trees and Graphs, which are fundamental data structures.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.
应用推荐