本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
如果具有子代，那么当前条目必须是一个文件夹，您要将其名称和递归级别推到辅助堆栈上并将它们添加到树中。
If so, then the current entry must be a folder, and you push its name and recursion level onto an auxiliary stack as well as adding it to the tree.
通过递归地比较当前节点下的树，该方法可以执行更深一步的比较，或者只是执行停留在当前节点的这种快速比较。
It can perform either a deep comparison that recursively compares the trees below the current node, or a quick comparison that stops at the current node.
设想一个场景，您想要递归地访问一个目录树，在该树中的每个文件及目录上停下来，并为每个查找到的条目调用您自己的回调方法。
Imagine a scenario in which you want to traverse a directory tree recursively, stopping at each file and directory under that tree and having your own callback methods invoked for each entry found.
应该熟悉下列与 XML 有关的计算机科学概念：树遍历、递归和数据重用。
You should be familiar with the following XML-related, computer-science concepts: tree traversal, recursion, and reuse of data.
解析阶段可能是最复杂的，因为它需要一定程度的递归设计来解析xml树。
The parsing stage might be considered the most complicated, as it requires a somewhat recursive design to parse the XML tree.
而且，令人感兴趣的是，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.
简单的非递归过程表达式并不能访问所有的元素，尽管许多库都包含有帮助功能，可以用于遍历树。
No simple non-recursive procedural expression accesses all elements, although many libraries include helper functions for walking the tree.
递归式遍历JSF组件树。
然后，JSF框架递归式地遍历组件树，更新组件状态。
Then, the JSF framework traverses the tree recursively, updating the state of the components.
但是只用递归函数来遍历树并不十分困难。
But walking a tree just by using recursive functions is not all that difficult.
接下来，您会看到如何创建一个定制组件来为它的所有嵌套组件设置styleclass属性，递归遍历jsf组件树。
Next, you'll see how to create a custom component that sets the styleClass attribute for all its nested components, traversing the JSF component tree recursively.
如果您使用-r命令行选项递归到其子目录中，标准的cp命令可用于复制整个目录树。
The standard cp command is capable of copying entire directory trees if you use the -r command-line option to recurse into subdirectories.
因为返回的SOAPElement在底层具有对象层次结构，所以必须递归地处理树以获得实际的数据对象。
Since the returned SOAPElement has a hierarchy of objects underneath, you have to iterate through the tree to get the actual data object.
研究了知识管理子系统的信息模型和树型结构的递归算法。
The recursive algorithmfor the information model and tree typed structure in the knowledge management subsystem has been studied.
为了构造一个树，第一件你该想的事情就是递归。
In order to construct a tree, the first thing you should think of is recursion.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
运用树的遍历技术进行实用潮流计算，递归方程的使用使得编程简单，并且不需要形成阻抗阵或导纳阵。
Efficient power flow is calculated by means of tree technique and recursion, which do not need resistance or admittance matrix.
先通过预处理提取出血管并进行三维细化，再递归跟踪血管骨架生成特征树并进行遍历提取出血管的分支点和端点。
The vessel skeleton was recursively tracked to generate the feature tree and the tree was traversed consequently to pick up the branch points and end points.
设计和实现了一种得到分布式程序的所有文件生成树的递归算法。
A realizable recursive algorism is proposed to search all the File Spanning Trees for a given program in the distributed system.
给出其支撑树数的一个公式，并得到其渐近性态和常数系数的线性递归关系。
A formula for the number of their spanning trees was given, Furthermore its asymptotic behaviors were considered and the linear recurrence relations with constant coefficients were also obtained.
下面的示例使用递归从本地文件系统填充xml树。
The following example populates an XML tree from the local file system using recursion.
内容包括：数组、链接表、栈和队列、递归、树与森林、图、排序、检索和散列结构等。
The contents are included as follows: Array, Linked List, Stack and Queue, Recursion, Tree and Forest, Graph, Sorting, Indexing and Hashing Structure, etc.
二叉树平衡的条件是左子树平衡且右子树平衡且左右子树的高度相差最多为1。基于这个思路递归处理。
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.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
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.
应用推荐