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.
如果具有子代，那么当前条目必须是一个文件夹，您要将其名称和递归级别推到辅助堆栈上并将它们添加到树中。
You should be familiar with the following XML-related, computer-science concepts: tree traversal, recursion, and reuse of data.
应该熟悉下列与 XML 有关的计算机科学概念：树遍历、递归和数据重用。
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.
而且，令人感兴趣的是，DB2返回结果时所依照的顺序暴露了递归如何逐层地而不是采用遍历树的方法进行处理。
In order to construct a tree, the first thing you should think of is recursion.
为了构造一个树，第一件你该想的事情就是递归。
Efficient power flow is calculated by means of tree technique and recursion, which do not need resistance or admittance matrix.
运用树的遍历技术进行实用潮流计算，递归方程的使用使得编程简单，并且不需要形成阻抗阵或导纳阵。
The following example populates an XML tree from the local file system using recursion.
下面的示例使用递归从本地文件系统填充xml树。
The paper used fractal recursion algorithm to construct the 3D tree model whose parameters were variable.
运用分形递归算法，构造了参数可变的三维树木通用模型。
Taking SQL Server as the platform, the depth-sorting algorithm for the double identity number tree-like data, realized by recursion, is explained in detail.
阐述了树形结构的数据在数据库中的两种存储方式单编号和双编号法，以及树形数据的排序算法。
A dynamic 8-tree structure and a relative self-similar recursion algorithm are presented to model a dynamic workpiece object, which is machinable.
提出了动态八叉树结构和相应的自相似裂变递归算法，实现了虚拟环境下的可加工工件动态建模。
Aimed at the low efficiency of real-time collision detection problem of simple 3d object on mobile platforms, this paper proposes a recursion detection algorithm using collision tree.
针对移动平台上大量的简单3d物体实时碰撞检测效率不高的问题，文中提出了以构建碰撞树为基础的碰撞遍历算法。
The contents are included as follows: Array, Linked List, Stack and Queue, Recursion, Tree and Forest, Graph, Sorting, Indexing and Hashing Structure, etc.
内容包括：数组、链接表、栈和队列、递归、树与森林、图、排序、检索和散列结构等。
The contents are included as follows: Array, Linked List, Stack and Queue, Recursion, Tree and Forest, Graph, Sorting, Indexing and Hashing Structure, etc.
内容包括：数组、链接表、栈和队列、递归、树与森林、图、排序、检索和散列结构等。
应用推荐