这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
假定一个树对象，并且想要以从左到右的顺序搜索它的叶子。
Suppose you have a tree object, and want to search its leaves in left-to-right order.
而且，令人感兴趣的是，DB2返回结果时所依照的顺序暴露了递归如何逐层地而不是采用遍历树的方法进行处理。
Further, it is interesting to note that the order in which DB2 has returned the results exposes how the recursion is processed one level at a time, instead of using a tree-walk.
树本身是按照前缀顺序将调试信息扁平化的一种表示方法。
The tree itself is represented by flattening it in prefix order.
将其余条目按下列顺序从类型树拖放到组件面板：姓名、电话、街道、城市、国家、邮政编码。
Drag and drop the rest items from the type tree to the component panel in the following order: name, phone, street, city, state, zip.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
但是与之前的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).
设计只能按顺序写的树可以实现效率。
Designing a tree model that can be written only sequentially allows efficiencies to be achieved.
其中五子棋博弈树搜索包括产生子结点顺序与访问结点的具体操作。
Gameplaying tree search includes the generation of node order and the concrete operation in accessing the nodes.
当排序变量设置为true时，会按照正确的顺序将两个受影响的项目重新创建为新的树项目，旧项目将从树中删除(第51 - 67和91 - 107行)。
When the sort variable is set to true, the two affected items are recreated as new tree items in the correct order, and the old items are removed from the tree (lines 51 to 67 and 91 to 107).
实验表明，相比于顺序点模型树，新方法的绘制速度更快，加速率至少在20%，特别是在处理大规模复杂模型时的加速率更高，能达67%以上。
Experimental results show the new method is at least 20% faster than the existing sequential point tree, and it is much faster in treating the large and complex models, more than 67%.
给出了版面逐层快速分解构造版面对象和基于有序树的阅读顺序确定算法。
Based on ordered tree, an algorithm for reading order detection after page top-down decomposition for constructing layout objects.
针对工件之间存在的加工顺序关系，引入“组装树”的概念。
According to the processing sequence of work pieces, we introduced the concept of "tree of assembly".
给出了版面逐层快速分解构造版面对象和基于有序树的阅读顺序确定算法。
Based on ordered tree, an algorithm for reading order detection after page top-down decomposition for constructing layout objects is presented.
把决策树分类器引入包过滤技术当中，改变了传统的顺序检索包过滤的方法。
Introducing the decision tree classifiers into packet filtering technology, it changes the conventional method searching the packet orderly.
要求列出了密钥树的顺序的时间吗？
对BDV阳性产物进行基因序列测定、同源性和氨基酸顺序分析，绘制系统发生树，初探bdv感染的分子流行病学特征。
Further, the gene sequence and amino acid sequence for BDV positive product were analyzed to establish the molecular epidemiologic characteristic by drawing phylogenetic tress.
大意：排队买票问题，后面来的总是把原来的人替换掉，并且使得原来的人往后移，让你顺序输出他们代表的编号，用线段树来记录空格数。
For each test cases, output a single line of space-separated integers which are the values of people in the order they stand in the queue.
时间顺序上，POD酶活性在统计学上最先表现出显著的差异性，其次是树体干部电容，之后是树体干部阻抗，最后是PPO酶活性。
The statistical difference of POD was showed firstly, the second index was tree stem capacitance, the third one was tree stem impedance and the last one was PPO.
为进一步完善整和图理论，采用顺序标号法给出龙虾树的一种整和标号。
This paper is an attempt to further improve the theory, of integral sum graph by introducing an integral sum labeling of the lobster tree through sequential labeling method.
为进一步完善整和图理论，采用顺序标号法给出龙虾树的一种整和标号。
This paper is an attempt to further improve the theory, of integral sum graph by introducing an integral sum labeling of the lobster tree through sequential labeling method.
应用推荐