红黑树是一个自平衡的二叉查找树。
结果表明，它比二元查找树更为有效。
The results show that it is more effective than the binary search tree.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
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.
清单17展示了一个示例收集器，它将在我们的树中查找字符串。
Listing 17 shows an example collector that looks for strings in our tree.
不需要在旧书里面查找最佳的算法以确定一个节点是否在树中另一个节点的前面。
No more searching into your old books for the best algorithm to find out whether one node is positioned before the old one in the tree.
您可以使用该节点树查找根元素及其所有的后代元素、属性和兄弟元素的节点。
Using that tree of nodes, you could find the node for the root element, along with all of the root element's descendants, attributes, and siblings.
JFS2还使用了B +树，以便更快地查找目录和管理分区描述符。
JFS2 also makes use of B + trees for fast directory lookups as well as managing extent descriptors.
这个调用将（以对数时间）遍历树，查找最靠近树根节点的电影公司电影汇总。
This will traverse the tree (in logarithmic time) and find the closest to the root node's summation of studio movies.
设想一个场景，您想要递归地访问一个目录树，在该树中的每个文件及目录上停下来，并为每个查找到的条目调用您自己的回调方法。
Imagine a scenario in which you want to traverse a directory tree recursively, stopping at each file and directory under that tree and having your own callback methods invoked for each entry found.
完成解析后，最常见的XML任务是在解析后的树中查找特定的数据。
After parsing, the most common XML task is to locate specific data of interest inside the parsed tree.
根据ID、元素类型或CSS类名查找元素非常有用，但如何根据元素在 DOM树中的位置执行查找呢？
Finding an element based on its ID, element type, or CSS class name is very useful, but what if you want to find an element based on its position in the DOM tree.
通过这个画笔示例，您了解到如何导航源代码树以及使用grep来查找实现您想修改的特性的代码。
Through the paintbrush example, you learned how to navigate the source tree and use grep to find to find the code that implements the features you want to modify.
第三，利用故障树分析理论对船舶冷藏集装箱故障进行分析研究，提供查找故障原因的方法。
Thirdly, with theory of fault tree analysis, faults of marine refrigerated container are studied, and methods of finding out faults' reasons are supplied.
每次向树中添加顶点后，都要遍历优先级队列查找并删除这样的边。
We could go through the queue looking for and removing any such edges each time we added a new vertex to the tree.
这些模式和故障诊断树都是为快速查找飞行器故障服务的，可以有效地提高飞行器试验的成功率。
These patterns and failure diagnostic tree both have served a search Vehicle failure quickly, could made a success of Vehicle experiment on it effectively in practical.
基于SPKI技术提出了组播分布式访问控制系统MDAC，并提出了基于二叉授权委托树的委托证书路径(DCP)查找算法。
Based on SPKI technology, proposing multicast distributed access control system: MDAC, as wall as, proposing a delegation certificate path (DCP) searching algorithm based on binary tree.
URL检索融合了树查找算法，在实现了快速检索的同时减少了存储空间需求。
The URL indexing algorithm based on tree searching, achieving both a fast searching speed and a significantly low storage requirement.
查找每个节点的级别，这样你就能够以缩进列表形式打印这棵树了。
Find the level of each node, so you can print the tree as an indented listing.
针对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.
属性值继承查找将查询当前元素，并继续遍历元素树直至页面根元素。
A resource lookup will query through the current element and further.
研究发现快速包分类算法EGT-PC由于压缩特里树路径带来规则集的大量冗余备份降低了算法的查找时间和存储空间等性能。
This paper found out the fast packet classification algorithm EGT-PC's search time and storage space performance were decreased by the rules' redundant copies.
该文提出了几种基于源转发树路由结构的多播路由表查找方案，并给出实验结果比较。
This paper gives several solutions of multicast route table lookup based on source-based route structure. And it gives experiment results and performance comparisons.
该文设计了一种基于键树思想的SPDB组织方式和相应的查找算法，使平均查找长度大为缩短。
The article designs a kind of SPDB organization based on key tree and corresponding query algorithm, which makes average query length shorten a lot.
用二叉树表示族谱，比如查找孩子，括号表示法等。
That the family tree with binary tree, for example, to find children, brackets indicate that law.
八叉树不易表达场景的相邻结点，本文设计了邻域查找算法以进行八叉树中相邻结点的查询。
In view of that the octree is not easy to express the adjacent nodes, we design a neighborhood search algorithms for querying the adjacent nodes.
与网格索引和R树索引相比，该索引以略大的空间开销换取了更高的查找性能。
Compared with grid and R-tree, the index has slightly space costs but most higher index performance.
资源查找将不会查询当前元素，但将跳到主题字典，而不是向上遍历元素树直至页面根元素，或检查应用程序字典。
Resource lookup will not query the current element but will skip over to the theme dictionaries, rather than walking up the element tree toward the page root, or checking application dictionaries.
树索引结合四叉树和R-树的各自优点，既可以满足较高的存储效率，又避免太多的无效查找，达到较好的查找性能。
QR-Tree index combines the advantage of Quadtree and R-Tree, not only serves the need of high storing efficiency, but also avoid of many invalidation query, in order to achieve good query capability.
应用推荐