• 要创建二叉树,可以简单的创建一个CSimpleBinaryTree对象并初始化。

    To create the Binary Tree simply create a CSimpleBinaryTree object and initialise it.

    youdao

  • 正如我所说,二叉树排序是一种非常有效且快速的方法。

    As I said, binary trees are a very efficient and fast way of sorting.

    youdao

  • 红黑树是一个自平衡的二叉查找树。

    Red-black tree is a self-balancing binary search tree.

    youdao

  • 描述二叉树(binarytree)的节点有一个数据值、一个左指针和一个右指针;不过,很多数据体要求树不只有一个左分支和一个右分支。

    Binary trees are represented by nodes that have a data value and a left and right pointer; however, there are many data structures that require trees with more than just a left and right branch.

    youdao

  • 增强的JFS2在执行索引节点搜索时使用二叉树表示形式,与JFS使用的线性方法相比,这种方法要好得多。

    Enhanced JFS2 USES a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.

    youdao

  • 二叉树方法就是比较常用的数值方法之一。

    The binomial tree is one of the numerical methods in common use.

    youdao

  • 利用DNA分子和连接酶的生物特性,提出DNA计算机中二叉树的链式存储结构的设计方法,并给出二叉树链式存储结构的形式描述。

    This paper proposed the method of designing linked storage structure of the binary tree in DNA computer, which utilized the biological characteristics of DNA molecules and ligases.

    youdao

  • 实验结果表明,基于SLM生成的二叉树能够较好地为语音停顿的预测做出贡献。

    The results of experiments show that the bintree based on SLM can make contribution to speech pauses' prediction effectively.

    youdao

  • 同时根据二叉树的前序遍历结果匹配血管段,有效地提高了匹配的速度和准确度。

    Vessel segments in two images are matched by the preorder traversal of the binary trees, and the method is proved fast and accurate.

    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

  • 二叉树是一个具有节点的数据结构,其每个节点最多包含两个子节点。

    A binary tree is a data structure with nodes that include no more than two linked nodes.

    youdao

  • 二叉树的操作和使用。

    Binary Tree, the operation and use.

    youdao

  • 写个程序找到一个二叉树的深度。

    Write a function to find the depth of a binary tree.

    youdao

  • 提出了一种基于二叉搜索树的证书撤消管理方案。

    This paper proposes a scheme of certificate revocation management based on binary search trees.

    youdao

  • 二叉树遍历的非递归算法相对于递归算法,减少了函数调用等开销,具有性能优势。

    Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.

    youdao

  • 算法基于双向式搜索原理,采用投影法、夹角最小的方法及二叉树理论。

    The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.

    youdao

  • 本文建立了列车进路的二叉树数据结构,并对列车进路自动排定搜索算法进行了研究探讨。

    The thesis sets up binary tree data structure of train route, and research train route automatic arrangement search arithmetic.

    youdao

  • 解析的最终结果是生成一个二叉树。

    The final output of analysis is a binary tree.

    youdao

  • 研究了基于一种新二叉树结构的二叉排序树的生成算法,并在此算法的基础上进行时间复杂度分析。

    This paper is devoted to a study of an algorithm of generating the binary-sort-tree on the new structure and, on the basis of this algorithm, an analysis is made of the time complexity.

    youdao

  • 给定一个二叉树的前序和中序遍历,重建这棵二叉树。

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

    youdao

  • 本文提出了一种基于动态二叉树的水印基数编码方案,并对水印中的常量进行编码以达到水印防篡改的目的。

    In this paper a novel radix encoding scheme based on dynamic binary-tree is presented, and the constants existed in the watermark is encoded to tamper-proof the watermark itself.

    youdao

  • 文章给出了1至N全排列问题的三种求解算法,分析了该问题在栈及二叉树计数中的应用。

    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.

    youdao

  • 树是二叉搜索树的泛化,其节点可以具有多于两个的子节点。

    The B-tree is a generalization of a binary search tree in that a node can have more than two children.

    youdao

  • 在传统的二叉树模型上加以一定的改进,使其能更适合可转换债券的特点,从而对可转换债券的定价达到更高的准确度。

    This paper improves binomial model in some aspects to make it more suitable to the properties of convertible bonds, then more accurate to pricing such a financial asset.

    youdao

  • 平衡二叉树和半边匹配数据结构的引入,提高了拓扑信息重建的速度。

    The execution rate of topological reconstruction is enhanced by introducing the AVL tree and half edge data structure.

    youdao

  • 当我们考虑一种更具体的二叉树——二叉搜索树时,识别子结点是很重要的。

    Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search 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

  • 对于在基于特征的设计过程中特征间的合成关系进行了分析,给出了二叉树的存储方法。

    The synthesis relationship between features in feature-based design procedure is analyzed and the storage structure of bifurcate tree is shown.

    youdao

  • 基于对标准幅面布局的分析,提出了一种基于二叉树的工程图组合排版算法。

    Through analyzing standard size's layout, this paper puts forward an algorithm of engineering drawing combination composing based on binary tree.

    youdao

  • 基于对标准幅面布局的分析,提出了一种基于二叉树的工程图组合排版算法。

    Through analyzing standard size's layout, this paper puts forward an algorithm of engineering drawing combination composing based on binary tree.

    youdao

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

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

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