In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in XSL would be inconvenient and unnecessary.
在上面的示例中，如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题，但是用XSL实现一个这样的数据结构并不是很方便，并且是不必要的。
It maintains the free space in heap as nodes in a Cartesian binary search tree format.
它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。
A binary search tree (BST) is a binary tree with the following properties.
二进制搜索树(BST)是具有以下属性的二进制树。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
Binary Search property is every node on left tree is lesser and every node on right is greater.
二进制搜索的财产是左树的每一个节点，每个节点是小右大。
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 algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
算法基于双向式搜索原理，采用投影法、夹角最小的方法及二叉树理论。
Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem.
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
Which search is faster, binary search or using prefix tree?
二进制搜索或者搜索速度更快，使用前缀树吗？
The thesis sets up binary tree data structure of train route, and research train route automatic arrangement search arithmetic.
本文建立了列车进路的二叉树数据结构，并对列车进路自动排定搜索算法进行了研究探讨。
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
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.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。
In this paper, the study of random binary search tree is a random graph theories of a tree.
本文所研究的随机二叉搜索树是随机图论二叉树的一种。
The second chapter is devoted to the basic knowledge of map and random binary search tree.
第二章介绍了图和随机二叉搜索树的基本知识。
Implement an iterator over a binary search tree (BST).
实现一个二叉搜索树(BST)的迭代器。
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.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
In this article, I will show you how to use the Binary Search Tree to store data.
在这篇文章中，我将告诉你如何使用二进制搜索树来存储数据。
Binary Search tree pre -, in -, post-order traversal for given tree.
二进制搜索树前，在-，邮政汇票遍历树。
The B-tree is a generalization of a binary search tree in that a node can have more than two children.
树是二叉搜索树的泛化，其节点可以具有多于两个的子节点。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search tree.
当我们考虑一种更具体的二叉树——二叉搜索树时，识别子结点是很重要的。
The elementary binary search algorithm and some improved algorithms were analyzed, and an adaptive anti-collision algorithm based on collision-tree (ACT) was proposed.
在对二进制搜索算法及其各种改进算法分析的基础上，提出了基于冲突树的标签自适应防碰撞算法(act)。
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）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
For this type of problem you can use Data Structure know as TREAP (Randomized Binary Search Tree).
对于这一类的问题你可以使用数据结构知道treap(随机二进制搜索树)。
Two elements of a binary search tree (BST) are swapped by mistake.
归并树跟划分树是一对好基友。
Two elements of a binary search tree (BST) are swapped by mistake.
归并树跟划分树是一对好基友。
应用推荐