红黑树是一个自平衡的二叉查找树。
正如我所说,二叉树排序是一种非常有效且快速的方法。
As I said, binary trees are a very efficient and fast way of sorting.
要创建二叉树,可以简单的创建一个CSimpleBinaryTree对象并初始化。
To create the Binary Tree simply create a CSimpleBinaryTree object and initialise it.
增强的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.
描述二叉树(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.
解析的最终结果是生成一个二叉树。
写个程序找到一个二叉树的深度。
判断一棵树是否为平衡二叉树。
我知道堆总是完全二叉树。
二叉树方法就是比较常用的数值方法之一。
The binomial tree is one of the numerical methods in common use.
二叉树的操作和使用。
提出了一种基于二叉搜索树的证书撤消管理方案。
This paper proposes a scheme of certificate revocation management based on binary search trees.
在数据分块组织的基础上构建了两层嵌套二叉树。
By organizing data block partition, two layer nested bintree were built.
提出了一种基于二叉树模型的配电网可靠性评估算法。
A reliability evaluation algorithm for distribution network based on binary tree is proposed.
阐述箱体类零件形状特征及形状特征二叉树建立过程。
The form feature of box part and establishing process of form feature binary tree are expounded.
有种特别的树,叫做二叉树,最多只能有两个子结点。
Special types of trees, called binary trees, restrict the number of children to no more than two.
给定一个二叉树的前序和中序遍历,重建这棵二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
给出了一种基于编码二叉树的支持向量的多类分类算法。
Produce an algorithm based on encoding binary tree and supporting vector multi-category classification algorithm.
采用一种层次分解的支持向量机二叉决策树进行分类识别。
A hierarchical decomposed support vector machines binary decision tree is used for classification.
二叉树是计算机科学中最基本的也是最重要的树型数据结构。
Binary trees are the most fundamental and important data structures used in computer science.
作者设计并实现了一个基于多变元逐步回归的二叉树分类器。
A binary tree classifier based on multivariate step-wise regression was designed and implemented.
提出了一种新的动态启发式二叉判定图(BDD)最小化算法。
A new dynamic heuristic binary decision diagram (BDD) minimization algorithm is proposed.
从而提出了基于虚拟二叉键树的分布式索引模型及其构建算法。
Then a model based on virtual binary key tree is put forward and the construction algorithm is given.
本文利用二叉判定图提出了对功能级数字电路的一种测试产生方法。
Using Binary Decision Diagrams, this paper proposes a test generation method for functional level digital circuits.
二叉树是一个具有节点的数据结构,其每个节点最多包含两个子节点。
A binary tree is a data structure with nodes that include no more than two linked nodes.
平衡二叉树和半边匹配数据结构的引入,提高了拓扑信息重建的速度。
The execution rate of topological reconstruction is enhanced by introducing the AVL tree and half edge data structure.
通过对3维模型特征二叉树进行相似性比较可以得到3维模型的相似性。
We can get the similarity among 3d models by matching the similarity among feature binary trees.
算法基于双向式搜索原理,采用投影法、夹角最小的方法及二叉树理论。
The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
文中结合完全二叉树结构,提出了一种新的基于身份的群密钥协商协议。
Combined with complete binary tree architecture, a new identity-based group key agreement protocol is proposed in this paper.
二叉树平面坐标网、平面坐标网二叉树的定义及其基本定理在本文给出。
The definitions of the binary tree plane coordinate net and the plane coordinate net binary tree, and their basic theorems are given in this paper.
应用推荐