Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
The Type of tree node is defined to show the link relation between nodes, and the depth-first strategy is employed to identify topology structure.
定义了树节点类来动态地反映节点间的链接关系，采用深度优先算法，快速识别网络拓扑结构的变化。
The itemset lattice tree data structure was adopted to translate maximal frequent itemsets mining into the process of depth-first searching the itemset lattice tree.
采用项集格生成树的数据结构，将最大频繁项集挖掘过程转化为对项集格生成树进行深度优先搜索获取所有最大频繁节点的过程。
To be systematic, I'm going to build this tree depth-first left-first.
为了保持系统性，我将要把这棵树设置，为深度优先和左边优先。
To be systematic, I'm going to build this tree depth-first left-first.
为了保持系统性，我将要把这棵树设置，为深度优先和左边优先。
应用推荐