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.

如果具有子代，那么当前条目必须是一个文件夹，您要将其名称和递归级别推到辅助堆栈上并将它们添加到树中。

youdao

This reduces memory usage during the iteration because the stack depth is constant instead of dependent on the height of the tree.

这减少了迭代过程中的内存占用，因为堆栈深度始终保持一致，而不依赖于树的高度。

youdao

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 解析器）”。

youdao