现在，这个决策树，如果我走左边的分支，这是一棵二叉树。
Now, the decision tree, if I branch left, it's a binary tree.
增强的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.
红黑树是一个自平衡的二叉查找树。
要创建二叉树，可以简单的创建一个CSimpleBinaryTree对象并初始化。
To create the Binary Tree simply create a CSimpleBinaryTree object and initialise it.
我不会详细介绍二叉树理论的详细细节，因为这些东西，Per Nilsson已经在他的“二叉树”中讨论过了，你可以在如下地址here找到详细的细节。
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.
描述二叉树(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.
正如我所说，二叉树排序是一种非常有效且快速的方法。
As I said, binary trees are a very efficient and fast way of sorting.
二叉树的操作和使用。
关于二叉树的相关知识和算法，适合学习数据结构和算法的朋友，欢迎下载！
On the tree of knowledge and algorithms for learning data structures and algorithms friends are welcome to download!
其次，将BOM的各种数据结构进行分析，选择了二叉树表示型的数据结构来存储bom，同时利用二叉树型的BOM实现从核心企业到节点企业的任务分解。
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.
实验结果表明，基于SLM生成的二叉树能够较好地为语音停顿的预测做出贡献。
The results of experiments show that the bintree based on SLM can make contribution to speech pauses' prediction effectively.
这是一个已经通过调试成功的二叉树算法程序，希望对大家有帮助。
This is a success has been through the debugging process tree algorithm, and they hope to help everyone.
二叉树方法就是比较常用的数值方法之一。
The binomial tree is one of the numerical methods in common use.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
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.
让你清晰的了解到二叉树的特点。
You clearly understand the characteristics of a binary tree.
二叉树是计算机科学中最基本的也是最重要的树型数据结构。
Binary trees are the most fundamental and important data structures used in computer science.
本文将对满二叉树的结构进行深入分析，采用深度遍历与广度遍历两种途径给出递推关系式。
This paper goes deeply into such tree's structure using both depth search and breadth search, and gives recursive relationship separately.
这个项目演示了模板、循环算子，以及用一个实现了二叉树的类进行的演示。
This article is an introduction to templates, iterators, and temporary classes illustrated by an implementation of a red-black tree.
提出了一种新的动态启发式二叉判定图(BDD)最小化算法。
A new dynamic heuristic binary decision diagram (BDD) minimization algorithm is proposed.
之间的差异的时间间隔段树，是什么树，二叉树和范围的树木？
What are the differences between segment trees, interval trees, binary indexed trees and range trees?
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
给定一个二叉树的前序和中序遍历，重建这棵二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
针对P 2 P网络中资源查找以及其自身存在的问题，提出了一种基于二叉树的P 2 P网络模型。
Focusing on the problems of the resource searching in P2P network, a P2P network model based on strictly binary tree is proposed.
利用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.
提出了一种基于二叉搜索树的证书撤消管理方案。
This paper proposes a scheme of certificate revocation management based on binary search trees.
给定一个二叉树，找到他的深度。
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
对于在基于特征的设计过程中特征间的合成关系进行了分析，给出了二叉树的存储方法。
The synthesis relationship between features in feature-based design procedure is analyzed and the storage structure of bifurcate tree is shown.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。
The highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.
提出了一种基于二叉树模型的配电网可靠性评估算法。
A reliability evaluation algorithm for distribution network based on binary tree is proposed.
应用推荐