Listing 1. Class hierarchy for binary trees of ints.
清单1. int二元树的类层次结构。
I know that heaps are always complete binary trees.
我知道堆总是完全二叉树。
Consider the following class hierarchy for binary trees of ints.
考虑以下的int二元树的类层次结构。
As I said, binary trees are a very efficient and fast way of sorting.
正如我所说，二叉树排序是一种非常有效且快速的方法。
Given two binary trees, write a function to check if they are equal or not.
题目大意：给定两个二叉树，判断两者是否是相同的二叉树。即结构相同且对应节点的值也相同。
Binary trees composed of directed relative height are adopted to describe curves.
这种曲线树是采用树的结构来描述曲线，其内部元素是有向相对高度。
How many binary trees can find that haven Node and the height of these tress are n-3?
有多少二叉树可以发现有n个节点和这些枝条的n - 3的高度吗？
Binary trees are the most fundamental and important data structures used in computer science.
二叉树是计算机科学中最基本的也是最重要的树型数据结构。
We can get the similarity among 3d models by matching the similarity among feature binary trees.
通过对3维模型特征二叉树进行相似性比较可以得到3维模型的相似性。
Finally algorithms for removing difficult visitable in postorder threaded binary trees are given.
给出了消除二叉后序线索树中困难访问的算法。
Special types of trees, called binary trees, restrict the number of children to no more than two.
有种特别的树，叫做二叉树，最多只能有两个子结点。
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
题目大意： 给定两个二叉树，判断两者是否是相同的二叉树。 即结构相同且对应节点的值也相同。
Given a sequence of binary trees, you are to write a program that prints a level-order traversal of each tree.
给定一个二叉树序列，你要写一个程序将每棵树按层序访问并打印出来。
In this paper, some new concepts in threaded binary trees, such as supple-links, local-root and local path are presented.
本文提出了二叉线索树中的准相连、局部根、局部路径概念。
In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.
在这个问题中，二叉树的每个节都值都为正整数，且每棵树的节点数都小于256。
We will introduce Linear Lists, Stacks, Queues, Strings, Binary Trees, Trees and Graphs, which are fundamental data structures.
主要包括的内容有：线性表，栈与队列，字符串，二叉树，树，图。
Vessel segments in two images are matched by the preorder traversal of the binary trees, and the method is proved fast and accurate.
同时根据二叉树的前序遍历结果匹配血管段，有效地提高了匹配的速度和准确度。
The pre order, in order and post order traversal of every binary tree are unique, but those of different binary trees may be identical.
但是不同的二叉树的先序遍历序列或中序遍历序列或后序遍历序列有可能是相同的。
Combining with the concrete hardware implementation, a parallel method of dividing one binary tree into several binary trees is put forward.
结合具体的硬件实现，提出了将一棵二叉树分解为几棵二叉树的并行方法。
Three kinds of computer architectures are discussed. They can speed up the computer to compile and execute chained lists, binary trees and quantifier algorithms.
本文提出了面向非数值算法的三种计算机系统结构的初步设想，可望用于链表算法、二叉树算法和量词算法。
Using this data structure, stray light analysis software of laser systems is programmed, the examples are given and the paraxial stray light binary trees are built.
利用这种数据结构，作者编制了激光光学系统杂散光分析软件，针对两个实例建立了近轴鬼光束树。
In this paper, algorithm f, which can fill in left local root on preorder in-threaded binary trees, and other related theorems, definitions and algorithms are presented.
本文给出了在二叉前序线索树中消除困难访问的填左局部根算法f。其他有关的定理、定义及算法也一并附出。
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.
描述二叉树(binarytree)的节点有一个数据值、一个左指针和一个右指针；不过，很多数据体要求树不只有一个左分支和一个右分支。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
This control can be used in studying of binary and other types of trees.
这种控制可用于二进制的树木和其他类型的研究。
This paper proposes a scheme of certificate revocation management based on binary search trees.
提出了一种基于二叉搜索树的证书撤消管理方案。
What are the differences between segment trees, interval trees, binary indexed trees and range trees?
之间的差异的时间间隔段树，是什么树，二叉树和范围的树木？
In this paper Some new methods using for increasing the system efficiency has been introduced, a special one is the technique called "strictly inverted sorting" about binary sorting trees.
本文介绍提高系统效率的一些新技术，特别是二叉分类树的严格倒排技术。并给出了实现算法。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Results of comparison show that the threaded binary-trees generated by the new method are more efficient than the traditional ones.
比较的结果表明，新算法所生成的线索二叉树比传统的先序和后序线索二叉树优越。
应用推荐