In computer terms, this rule is also known as recursive tree descent.
以计算机术语表述，这条规则也可以称作递归树下行。
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
The parsing stage might be considered the most complicated, as it requires a somewhat recursive design to parse the XML tree.
解析阶段可能是最复杂的，因为它需要一定程度的递归设计来解析xml树。
But walking a tree just by using recursive functions is not all that difficult.
但是只用递归函数来遍历树并不十分困难。
No simple non-recursive procedural expression accesses all elements, although many libraries include helper functions for walking the tree.
简单的非递归过程表达式并不能访问所有的元素，尽管许多库都包含有帮助功能，可以用于遍历树。
The recursive algorithmfor the information model and tree typed structure in the knowledge management subsystem has been studied.
研究了知识管理子系统的信息模型和树型结构的递归算法。
According to activity-on-node disassembly tree, the recursive procedure of disassembly cost is set up.
根据结点式拆卸树，构建了拆卸成本的递推算法；
A new method of tree scheme knowledge representation is proposed. It enables the recursive query process to consult the states of the extensional database, making the algorithm more efficient.
提出了一种树形知识表示方法，使递归查询可参考事实库状态，从而获得更高效的算法。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
This paper introduces a newly generalized and dynamic structure for the similarity retrieval of high dimensional feature vectors called the recursive clustering index tree.
文章提出了一种新的适用于高维特征矢量相似检索动态聚类索引树结构。
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.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
应用推荐