树的遍历用英语怎么说，树的遍历的英文翻译

词语导航

基本信息

词语：树的遍历

繁体：樹的遍歷

拼音：shù de biàn lì

英语翻译

【计】 traversal of tree; traverse of tree

分词翻译

树的英语翻译：

arbor; cultivate; establish; set up; tree
【计】 T; tree
【医】 arbor; arbores; tree

遍历的英语翻译：

【计】 ergod; traversal; traversing

翻译例句

1. 清单3是对清单2的改写，它使得树的遍历算法更明显。

Listing 3 is a rewrite of Listing 2 that makes the tree walking more explicit.

2. 为了避免依靠处理程序操作树，这个样式表有一个命名模板main实现了树的遍历。

Instead of relying on the processor to operate the walk, this stylesheet has a named template, main, that implements the tree walking.

3. 数学表达式、栈的操作、二又树的遍历，这几个概念在数据结构的教材中是不可缺少的。

The concepts such as mathematical expression, stack operation and binary tree traversal must be presented in data structure.

4. 即先用RSA方法加密密钥矩阵，然后用二叉树的遍历产生的不同密钥数据矩阵对数据进行加密。

First, produce key with RSA and construct a binary tree, then traverse the binary tree to produce new keys. And there must be a certain key to encrypt data with all the other encoding methods.

5. 运用树的遍历技术进行实用潮流计算，递归方程的使用使得编程简单，并且不需要形成阻抗阵或导纳阵。

Efficient power flow is calculated by means of tree technique and recursion, which do not need resistance or admittance matrix.

6. 对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。

By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.

7. 注意声明方法：您指定如何处理元素，处理器(通过其内置的树遍历逻辑)决定何时应用模板。

Note the declarative approach: you specify what to do with the elements and the processor (through its built-in tree walking logic) decides when to apply a template.

8. 这个调用将（以对数时间）遍历树，查找最靠近树根节点的电影公司电影汇总。

This will traverse the tree (in logarithmic time) and find the closest to the root node"s summation of studio movies.

9. 这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。

Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.

10. 这种在解析期间修改文档结构的做法可以使 DOM树占用更少的内存，而且还可以减少在内存中遍历和修改文档时所花的时间。

Such modifications of the document structure during parsing can result in a smaller memory footprint for the DOM tree, and also reduce the time spent traversing a document and modifying it in memory.

11. 从XML文档内容显示的xml树可以直接编辑，从而促进轻松的遍历。

The XML tree displayed from the XML document content can be edited directly facilitating easy traversal.

12. 应该熟悉下列与 XML 有关的计算机科学概念：树遍历、递归和数据重用。

You should be familiar with the following XML-related, computer-science concepts: tree traversal, recursion, and reuse of data.

13. 然后遍历原始的文档树并复制到输出文档树中。

It then traverses the original document tree by copying it to the output document tree.

14. 使用XML编辑器的另一个优点是，它们具有面向上下文的选项，比如树视图，它让用户可以轻松地遍历XML文档的各个节点。

Another advantage of using XML editors is that they have context-oriented options, such as the tree view which enables a user to traverse the various nodes of an XML document easily.

15. 但对于较大的树来说，我们更希望以迭代的方式遍历，从而节约内存。

But in the case of larger trees, we might prefer to traverse iteratively, in order to preserve memory.

16. 我们首先遍历树，传递一个仅打印所访问的节点并返回该节点的函数。

We first walk the tree and pass a function that merely prints the node being visited and returns the node.

17. 而且，令人感兴趣的是，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.

18. 遍历树时，更改是在当前关注节点的本地做出的，也就是说除了向上移动之外，所有操作都是常量时间的。

As we traverse the tree, changes are local to the current focal node, meaning all constant-time operations except for up.

19. 第2部分展示了如何通过遍历jsf组件树并获取输入组件的值来保存当前视图的表单数据。

Part 2 shows how to save the form data of the current view by traversing the JSF component tree and getting the values of the input components.

20. 每个XML文档均是定义良好的元素和属性树，并使用树遍历来表示XML查询。

Any XML document is a well-defined tree of elements and attributes, and XML queries are expressed in terms of tree traversal.WWw.WEntIYI.CoM

21. 图10展示了在我们遍历树时位置结构发生了怎样的变化，在这里向下(始终下移至左侧第一个子节点)，随后向右，然后再向下。

Figure 10 illustrates how the location structure changes as we traverse the tree, here going down (always to the first left child), then right, then down.

22. 该审计会遍历contentstore树并会记录它所找到的所有对象(文件夹、报告、查询等)。

This audit will process through the content store tree and log all the objects (folders, reports, queries, etc.) that it finds.

23. 对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。

Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.

24. 尽管XPath提供了一种紧凑和优雅的方式来遍历xml树，但其模式匹配函数的能力相当有限。

While XPath provides a compact and elegant way of traversing an XML tree, its pattern matching functions have a rather limited capability.

25. 接下来，您会看到如何创建一个定制组件来为它的所有嵌套组件设置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.

26. 编写客户机端代码以遍历在运行时生成的解析树并对其求值。

Write client-side code to walk and evaluate the parse tree that"s produced at runtime.

27. 与前面的方法相似，但是它给出两个附加的参数来指定访问选项，以及遍历将访问文件树中的多少个目录。

Is similar to the preceding method but gives you two additional parameters to specify visit options and how many directories deep into the file tree the traversal should go.

28. 我们可以利用两个方法中的任何一个在类上启动树遍历。

We can use either of two methods on the java.nio.Files class to start the tree traversal.

29. 正则表达式提供了跨文本的字符串的更丰富的模式匹配，但在遍历诸如xml树这样的数据结构时，它和XPath一样易于使用。

Regular expressions provide much richer pattern matching across strings of text, but are as easy to use as XPath when traversing a data structure such as an XML tree.

30. 使用相对路径允许您通过遍历目录树，链接到一个您需要的文件，例如。

The use of relative paths allows you to link to a file by walking up and down the tree of directories as needed, for instance.