To be systematic, I'm going to build this tree depth-first left-first.
为了保持系统性，我将要把这棵树设置，为深度优先和左边优先。
We now have a fast, easy way to upload files from a local directory tree of any depth to a remote server.
现在我们有了一个从任意深度的本地目录树上载文件到远程服务器上的快速、方便的方法。
You can easily customize it to show the navigation in a flat list or in a tree hierarchy of varying depth.
您可以轻松对它进行自定义，以在平级列表或在具有不同深度的树层次结构中显示导航。
This reduces memory usage during the iteration because the stack depth is constant instead of dependent on the height of the tree.
这减少了迭代过程中的内存占用，因为堆栈深度始终保持一致，而不依赖于树的高度。
The obvious way to explore the tree would be to simply evaluate every move and the responses to it to whatever depth time allows.
探索这棵树最明显的方法就是评估每一步和其随后的在时间允许内的所有可能的响应步骤。
This constant depth extent tree provides a rich representation scheme for large, potentially sparse files.
这种持续的区段树为大文件(尤其是分散的文件)提供丰富的表示方式。
The depth of the expected response XML tree.
预期响应XML树的深度。
InfoQ: Does Repository Manager support traversal of dependency tree of arbitrary depth?
InfoQ：RepositoryManager支持遍历任意深度的依赖树吗？
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
As already discussed in the comments, to make things simple, you can add entries to the array to make its size a power of two, so the binary tree has the same depth for all leaves.
在评论中已经讨论的，使事情变得简单，你可以添加条目到阵列使其大小两个电源，所以二进制树的所有的叶子，相同的深度。
The overhanging tree branches complete the frame and add depth to the subject.
上面悬挂的树的分枝形成了框架并给主体增添了深度。
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
解决博弈问题的传统算法——搜索树法所无法克服的对搜索深度的限制。
The overhanging tree branches complete the frame. and add depth to the subject.
上面悬挂的树的分枝形成了框架并给主体增添了深度。
This paper introduces the classification model of random decision tree and how to heuristic selected the depth and the number, the experiment shows that the algorithm is effectiveness and efficiency.
该文介绍了随机决策树分类模型及如何启发式选择随机决策树的深度及棵树，通过实验证明了该算法的有效性和高效性。
The choice of attribute selection metric to split has an important impact on the shape and the depth of the resulting decision tree.
在根据入侵规则构造决策树时，所依据的分类属性选择标准对决策树的形状和深度有很大的影响。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
摘要解决博弈问题的传统演算法搜索树法所无法克服的对搜索深度的限制。
It constructs a prefix tree to represent the sequence patterns, and continuously maintains the tree structure by using width pruning and depth pruning.
该算法构造了前缀树表示序列模式，并用广度剪枝和深度剪枝维护该前缀树的结构。
Write a function to find the depth of a binary tree.
写个程序找到一个二叉树的深度。
Is the depth how many leaf nodes 5's entirely two fork tree have after all?
深度为5的满二叉树到底有多少个叶子节点？
Combining the directional heuristic strategy with the tree searching algorithm of depth priority, an orientated tree algorithm of searching efficient paths is proposed.
通过将交通路网中路径搜索的定向式启发策略与深度优先的树搜索算法相结合，提出了一种有效路径的定向树搜索算法。
The meadow mouse has slept in his snug gallery in the sod, the owl has sat in a hollow tree in the depth of the swamp, the rabbit, the squirrel, and the fox have all been housed.
田鼠已经舒舒服服地在地底下的楼房中睡着了，猫头鹰安坐在沼地深处一棵空心树里面，兔子、松鼠、狐狸都躲在家里安居不动。 看家的狗在火炉旁边安静地躺着，牛羊在栏圈里一声不响地站着。
The meadow-mouse has slept in his snug gallery in the sod, the owl has sat in a hollow tree in the depth of the swamp, the rabbit, the squirrel, and the fox have all been housed.
田鼠已经舒舒服服地在地底下的楼房中睡着了，猫头鹰安坐在沼地深处一棵空心树里面，兔子、松鼠、狐狸都躲在家里安居不动。 看家的狗在火炉旁边安静地躺着，牛羊在栏圈里一声不响地站着。
The depth of this function in the call tree.
此函数在调用树中的深度。
Given a binary tree, find its maximum depth.
给定一个二叉树，找到他的深度。
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.
定义了树节点类来动态地反映节点间的链接关系，采用深度优先算法，快速识别网络拓扑结构的变化。
Given a binary tree, find its minimum depth.
给定一棵二叉树，计算其最小深度。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
对于这个问题，一个高度平衡的二叉树是指每个节点的两个子节点的深度的差异都不超过1的二叉树。
The decision tree constructed with the new standard of attribute selection has the following characteristics: fewer leaf nodes, fewer levels of average depth, better generalization of leaf nodes.
用新的属性选择标准生成的决策树一般具有叶子数目较少，叶子的平均深度也较小，且叶子具有较强的泛化能力。
应用推荐