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


词语导航

基本信息

词语:遍历树

繁体:遍歷樹

拼音:biàn lì shù

英语翻译

【计】 traverse tree

分词翻译

遍历的英语翻译:

【计】 ergod; traversal; traversing

树的英语翻译:

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

翻译例句

1. 但是只用递归函数来遍历树并不十分困难。

But walking a tree just by using recursive functions is not all that difficult.

2. 假设你需用栈来实现遍历树的数据结构。

For example, imagine you need a data structure for tree traversal and choose to write a stack.

3. 而另一人使用后风格的遍历树的所有儿童。

While the other one use post-style to walk through all children of the tree.

4. 二进制搜索树前,在-,邮政汇票遍历树。

Binary Search tree pre -, in -, post-order traversal for given tree.

5. 相反,我继续遍历树,比较解决方案,以找到最好的之一。

Instead, I continue to traverse the tree, and compare the solutions to find the best one.

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

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

7. 这个调用将(以对数时间)遍历树,查找最靠近树根节点的电影公司电影汇总。

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

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

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

9. 简单的非递归过程表达式并不能访问所有的元素,尽管许多库都包含有帮助功能,可以用于遍历树。

No simple non-recursive procedural expression accesses all elements, although many libraries include helper functions for walking the tree.

10. 一个原生的sequence使用索引访问下一个元素,这样可能导致每次访问的时候都需要遍历树。

A primitive sequence that would always use an index to access the next element would incur the cost for walking the tree at every access.

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

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

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

13. 图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.

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

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.

15. 在这个步骤中,您将遍历源文件系统树。

In this step, you will traverse the source file system tree.

16. 您可以遍历文档树、删除节点或者嫁接新节点。

You can traverse the document tree, prune nodes, or graft on new ones.

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

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

18. 成功遍历xml树之后,该函数就用PHP关联数组转换和存储了所有的XML元素(根元素和所有的孩子元素)。

At the end of a successful XML tree walk, this function will convert and store all the XML elements (the root element and all the child elements) in a PHP associative array.

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

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

20. 我们需要定义一个操作来遍历映射树、在树中搜索一个模式,并在该点应用一项操作。

We want to define an operation that walks over our tree of maps, searches for a pattern in the tree, and applies a manipulation at that point.

21. 一般而言,如果应用程序需要处理大型文档或者不大可能遍历整棵树时,应该使用这种延迟实现。

In general, you should use the deferred implementation if your application needs to process large documents and if your application is not intending to traverse the whole tree.

22. 从这个根节点,就可以遍历整个xml树。

From this root node, you can traverse the entire XML tree.

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

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

24. 递归式遍历JSF组件树。wwW.WeNtiyI.com

Traversing the JSF component tree recursively.

25. 第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.

26. 然后,JSF框架递归式地遍历组件树,更新组件状态。

Then, the JSF framework traverses the tree recursively, updating the state of the components.

27. DB 2使用XSCAN操作符来遍历XML文档树,如需要,还将计算谓词和提取文档片断和值。

DB2 USES the XSCAN operator to traverse XML document trees and, if needed, to evaluate predicates and extract document fragments and values.

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

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

29. 图2——代理服务器遍历决策树。

Figure 2-proxy server traversal decision tree.

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

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

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!