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

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

    youdao

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

    假设需用栈来实现遍数据结构

    youdao

  • Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.

    说明:操作建立二叉树,序遍二叉树、中序、后序遍历二树。

    youdao

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

    每个XML文档均定义良好元素属性使用树遍历来表示XML查询

    youdao

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

    应该熟悉下列与 XML 有关计算机科学概念遍历数据重用

    youdao

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

    数学表达式操作二又的遍几个概念数据结构的教材中是不可缺少的。

    youdao

  • Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.

    利用递归实现中序遍,利用队列实现二叉树层次遍历。

    youdao

  • Enter the tree traversal Preorder traversal of the results and the results of established tree and gives the results after the traversal.

    输入结果中序遍历结果建立起棵树给出序遍历结果。

    youdao

  • Runtime APIs, such as DOM, are moving towards allowing programmers to write XPath expressions rather than writing explicit tree traversal code (which can be painful).

    运行时api诸如dom正在倾向于允许程序员编写XPath表达式不是编写明确的遍历代码(后者是一个痛苦的过程)。

    youdao

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

    XML文档内容显示xml可以直接编辑从而促进轻松遍历

    youdao

  • Figure 2-proxy server traversal decision tree.

    2——代理服务器遍历决策

    youdao

  • 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.

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

    youdao

  • InfoQ: Does Repository Manager support traversal of dependency tree of arbitrary depth?

    InfoQRepositoryManager支持遍历任意深度依赖吗?

    youdao

  • Note that in traversing a tree, at any point in the traversal, a node can be the root of a new subtree.

    注意穿越中,任何一个节点都可能新的子树

    youdao

  • 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.

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

    youdao

  • Zippers allow that focal node to travel around the tree, getting constant-time access wherever you are (not including the traversal time to reach the node).

    zippers允许关注节点沿移动,使任意位置获得常量时间访问(包括到达节点遍历时间)。

    youdao

  • Given preorder and inorder traversal of a tree, construct the binary tree.

    给定一个遍历重建棵二叉树。

    youdao

  • The pre order, in order and post order traversal of every binary tree are unique, but those of different binary trees may be identical.

    但是不同先序遍序列遍历序列序遍历序列有可能相同的。

    youdao

  • One way to serialize a binary tree is to use pre-oder traversal.

    先序遍序列化二叉方式之一。

    youdao

  • Given preorder and inorder traversal of a tree, construct the binary tree.

    给定遍历构造

    youdao

  • Then, dynamic optimized the orders of service process by parthenogenetic algorithm in the process of depth-first traversal of the process tree.

    通过深度优先遍历流程树,利用单亲遗传算法流程效劳停止优化组合

    youdao

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

    二进制搜索-邮政汇票树。

    youdao

  • User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.

    以用户指定节点起点,分别输出每种历下节点访问序列相应生成。- one。

    youdao

  • Given a sequence of binary trees, you are to write a program that prints a level-order traversal of each tree.

    给定序列一个程序棵树按层序访问并打印出来。

    youdao

  • In the data structure, the binary tree can be uniquely confirmed when the nodes sequences of this binary tree for preorder traversal and inorder traversal are knows.

    数据结构中,已知一序列和中序序列,唯一确定二叉树。

    youdao

  • In the data structure, the binary tree can be uniquely confirmed when the nodes sequences of this binary tree for preorder traversal and inorder traversal are knows.

    数据结构中,已知一序列和中序序列,唯一确定二叉树。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定