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.
如果具有子代，那么当前条目必须是一个文件夹，您要将其名称和递归级别推到辅助堆栈上并将它们添加到树中。
This reduces memory usage during the iteration because the stack depth is constant instead of dependent on the height of the tree.
这减少了迭代过程中的内存占用，因为堆栈深度始终保持一致，而不依赖于树的高度。
One approach to safe XML generation is sending SAX events, as Henri suggests in, "Use a tree or a stack (or an XML parser)."
正像 Herni 所提到的，安全创建XML 的一种方法是发送SAX事件，“使用树或栈（或者 XML解析器）”。
This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.
文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。
The surface force per unit area exerted at the top of a wellbore when it is closed at either the Christmas tree or the BOP stack.
当采油树或防喷器组关闭时，施加在井口单位面积上的力称之为为关井压力。
If this exception is thrown by your application and you need to have a deeper visual tree, you can increase the application's stack size.
如果您的应用程序引发此异常，并且需要有较深的可视化树，您可以增加应用程序的堆栈大小。
The concepts such as mathematical expression, stack operation and binary tree traversal must be presented in data structure.
数学表达式、栈的操作、二又树的遍历，这几个概念在数据结构的教材中是不可缺少的。
Application inclusive values indicate the time that instances of a function that were called by the parent function in the call tree were on the call stack.
“应用程序非独占”值指示调用树中父函数所调用的函数实例在调用堆栈上的时间。
Elapsed inclusive values indicate the time on the call stack of those instances of the function that were called by the parent function in the call tree.
“已用非独占”值指示调用树中父函数所调用的那些函数实例在调用堆栈上的时间。
For example, imagine you need a data structure for tree traversal and choose to write a stack.
假设你需用栈来实现遍历树的数据结构。
As input a sentence, if the sentence is lawful sentence corresponding output syntax tree to the output of the process every step of the sign changes in the stack.
如输入一个句子，如果该句子合法则输出与句子对应的语法树；能够输出分析过程中每一步符号栈的变化情况。
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.
内容包括：数组、链接表、栈和队列、递归、树与森林、图、排序、检索和散列结构等。
应用推荐