增强的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.
有种特别的树,叫做二叉树,最多只能有两个子结点。
Special types of trees, called binary trees, restrict the number of children to no more than two.
二叉树是一个具有节点的数据结构,其每个节点最多包含两个子节点。
A binary tree is a data structure with nodes that include no more than two linked nodes.
设计一个算法序列化、反序列化一棵二叉树。
Design an algorithm to serialize and deserialize a binary tree.
树中的结点最多有两个子结点的树叫做二叉树。
A binary tree is defined as a tree where each node can have no more than two children.
在数据分块组织的基础上构建了两层嵌套二叉树。
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.
给定一个二叉树的前序和中序遍历,重建这棵二叉树。
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 binary tree classifier based on multivariate step-wise regression was designed and implemented.
二叉树定价模型虽然适合各种期权估价,但存在缺陷,如精度问题。
Binomial tree can be applied to pricing of all kinds of options, but it has a lot of flaws, such as accuracy.
平衡二叉树和半边匹配数据结构的引入,提高了拓扑信息重建的速度。
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.
给定一个二叉树序列,你要写一个程序将每棵树按层序访问并打印出来。
Given a sequence of binary trees, you are to write a program that prints a level-order traversal of each tree.
二叉树平面坐标网、平面坐标网二叉树的定义及其基本定理在本文给出。
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.
该算法在使二叉树达到最优的运算过程中,完全区别于以往的哈夫曼算法。
This algorithm is totally different from previous huffman algorithm in the operation process of optimizing binary tree.
结合具体的硬件实现,提出了将一棵二叉树分解为几棵二叉树的并行方法。
Combining with the concrete hardware implementation, a parallel method of dividing one binary tree into several binary trees is put forward.
基于二叉树和模糊逻辑理论,提出了一种用于复杂系统建模的模糊树模型。
Based on the binary tree structure and fuzzy logic theory, a fuzzy tree model applied to complex system modeling is proposed in this paper.
本文提出了舰船目标吨位识别的四维特征向量,设计出完整的二叉树分类器。
This paper gives characteristic vectors of four dimensions for target tonnage identification and design of binary tree classifiers pattern recognition.
基于对标准幅面布局的分析,提出了一种基于二叉树的工程图组合排版算法。
Through analyzing standard size's layout, this paper puts forward an algorithm of engineering drawing combination composing based on binary tree.
当我们考虑一种更具体的二叉树——二叉搜索树时,识别子结点是很重要的。
Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search tree.
在数据结构中,已知一棵二叉树的先序序列和中序序列,可唯一确定此二叉树。
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.
实验结果表明,基于SLM生成的二叉树能够较好地为语音停顿的预测做出贡献。
The results of experiments show that the bintree based on SLM can make contribution to speech pauses' prediction effectively.
同时根据二叉树的前序遍历结果匹配血管段,有效地提高了匹配的速度和准确度。
Vessel segments in two images are matched by the preorder traversal of the binary trees, and the method is proved fast and accurate.
二叉树遍历的非递归算法相对于递归算法,减少了函数调用等开销,具有性能优势。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
二叉树遍历的非递归算法相对于递归算法,减少了函数调用等开销,具有性能优势。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
应用推荐