binary tree中文，binary tree的意思，binary tree翻译及用法

binary tree 英语释义

英语释义

1. a network in which each node has no more than two subordinate nodes
She talks about binary trees, Hercules cutting off the heads of a mythical hydra (each severed neck grows two new heads, which is the essence of a binary tree) …
— Kenneth Chang, New York Times, 18 Jan. 2011

binary tree 片语

片语

Balancing Binary Search Tree自平衡二叉查找树

binary rooted tree二元有根树

binary regular tree二叉正则树

modified binary-tree修正二叉树

multidimensional binary search tree多维二进制搜寻树

binary triangles tree二叉三角树

Binary signature tree二进制签名树

Binary-tree disassembly二叉树分解

binary searching tree二叉查找树

binary tree 例句

英汉例句

enhanced jfs2 uses a binary tree representation while performing inode searches, which is a much better method than the linear method used by jfs.
增强的jfs2 在执行索引节点搜索时使用二叉树表示形式，与jfs使用的线性方法相比，这种方法要好得多。
on the basis of the rule of traversing binary tree, a simple and convenient method to judge a fully binary tree is proposed.
根据二叉树的层次遍历原则，设计了一种在遍历二叉树的过程中实时判别完全二叉树的简便方法。
i won「t go into the gory details of binary tree theory as this has already been discussed by per nilsson in his 「balanced binary tree」 submission found here.
我不会详细介绍二叉树理论的详细细节，因为这些东西，pernilsson已经在他的「二叉树」中讨论过了，你可以在如下地址here找到详细的细节。
a system model is created and the cost of every step is calculated in binary tree structure by using uml and its case.
使用uml建立系统模型，根据uml的图例，采用二叉树的结构，计算出每个步骤的成本；
compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
for a problem size of n (assuming a very small sequential threshold), o(n) threads would be required to solve the problem (the problem tree has depth log2n, and a binary tree of depth k has 2k nodes).
对于大小为n（假设为一个很小的顺序阙值）的问题，将需要o(n) 个线程来解决问题（问题树深度为log2n，深度为k的二进制树有2k 个节点）。
next, it analyzed various kinds of data structure of bom and chose binary tree as the data structure to save bom, and realize duty decomposition from the core enterprise to the node enterprise.
其次，将bom的各种数据结构进行分析，选择了二叉树表示型的数据结构来存储bom，同时利用二叉树型的bom实现从核心企业到节点企业的任务分解。
second, a synthesis strategy is designed to construct a binary tree model of multiple templates」 topological structure.
然后，在拓扑结构表示上通过综合来构造多模板的二叉树模型；
calculates the pressure, current of every node, and loss of downriver line by binary tree algorithm model.
采用二叉树算法模型，计算模型上各节点的电流、电压及其下游线路的损耗；
the non-balanced binary tree is constructed based on the prior distribution of samples, which can make the more separable classes separated at the upper node of the binary tree.
该方法通过分析已知类别样本的先验分布知识，构造一个二叉决策树，使容易区分的类别从根节点开始逐层分割出来，以获得较高的推广能力。
with a little more effort, i can express a binary tree -- a tree with each node holding a value and exactly two branches. a simple binary tree in haskell looks like this
只要多付出一点功夫，就能表达 b树 —— b树的每个节点都容纳一个值和两个分支。
for some purposes a binary tree is the best solution, but usually the simpler linked list is the obvious choice.
对于某些情况，二叉树是最佳选择，但在通常情况下，更简单的链表是显而易见的选择。
this paper gives characteristic vectors of four dimensions for target tonnage identification and design of binary tree classifiers pattern recognition.
本文提出了舰船目标吨位识别的四维特征向量，设计出完整的二叉树分类器。
binary tree is one of the most fundamental and important data structure used in computer science.
二叉树是树型数据结构中最基本也最重要的一种，在计算机学科的众多领域中有着广泛的应用。
but given you need to use a binary tree, i would store (index, value) in the binary tree and key on index.
但你需要使用一个二进制树，我会把（指数，值）在二树和关键指标。
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.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
a binary search tree (bst) is a binary tree with the following properties
二进制搜索树 (bst)是具有以下属性的二进制树
to create the binary tree simply create a csimplebinarytree object and initialise it.
要创建二叉树，可以简单的创建一个csimplebinarytree对象并初始化。
a red-black tree (or symmetric binary b-tree) is a self-balancing binary tree invented by rudolf bayer.
红黑树（平衡二叉树）是自平衡二叉树，由rudolfbayer发明。
the primary reason to prefer the rpc/encoded style is for data graphs. imagine that you have a binary tree whose nodes are defined in listing 12.
设想您有一个二进制树，其中的节点定义在清单12中。