Implement an iterator over a binary search tree (BST).
实现一个二叉搜索树(BST)的迭代器。
The gridding arithmetic of search tree of robotic path is derived.
同时，还推导了机器人路径搜索树网格算法。
Two elements of a binary search tree (BST) are swapped by mistake.
归并树跟划分树是一对好基友。
Binary Search tree pre -, in -, post-order traversal for given tree.
二进制搜索树前，在-，邮政汇票遍历树。
A binary search tree (BST) is a binary tree with the following properties.
二进制搜索树(BST)是具有以下属性的二进制树。
In this article, I will show you how to use the Binary Search Tree to store data.
在这篇文章中，我将告诉你如何使用二进制搜索树来存储数据。
It maintains the free space in heap as nodes in a Cartesian binary search tree format.
它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。
The second chapter is devoted to the basic knowledge of map and random binary search tree.
第二章介绍了图和随机二叉搜索树的基本知识。
In this paper, the study of random binary search tree is a random graph theories of a tree.
本文所研究的随机二叉搜索树是随机图论二叉树的一种。
The algorithm provides the possibility of reducing the size of the search tree and running time.
该算法从理论上提供了减小搜索树的规模及运行时间的可能性。
For this type of problem you can use Data Structure know as TREAP (Randomized Binary Search Tree).
对于这一类的问题你可以使用数据结构知道treap(随机二进制搜索树)。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
解决博弈问题的传统算法——搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
摘要解决博弈问题的传统演算法搜索树法所无法克服的对搜索深度的限制。
Bounded search tree and dynamic programming are frequently-used techniques in parameterized algorithm.
在典型的参数算法中，有界搜索树和动态规划是常用技术。
Every node in search tree corresponds a RCPSP, and the RCPSP is solved to obtain schedule for the RLP.
搜索树的每一节点对应一个RCPSP，通过求解各节点rcps P来求得rl P的最优调度计划。
The B-tree is a generalization of a binary search tree in that a node can have more than two children.
树是二叉搜索树的泛化，其节点可以具有多于两个的子节点。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
The branching factor of a regular search tree has a decisive effect on the time complexity of a search algorithm.
正则搜索树的分支因数对算法的复杂度有决定性影响。
Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search tree.
当我们考虑一种更具体的二叉树——二叉搜索树时，识别子结点是很重要的。
In this paper, we put forward a region representation data structure-digital search tree (DST) and its lineal encoding (LDST).
本文提出一种用于区域表达的数据结构——数字搜索树(DST)及其线性化编码(LDST)。
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
强连通分量形成了搜索树，他们的根就是强连通分量的根。
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.
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
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.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。
But can we make it more efficient in time with a tolerable space increment? We need to analyse the algorithm and the data structure of ternary search tree.
但是我们能在可容忍的空间使用增加上，进一步提高它的时间效率吗？我们需要分析三元搜素树的算法与结构。
This paper presents an optimization model of virtual design for project search tree problem, which can be solved by using the characteristic artificial neural net.
针对虚拟设计中的方案树搜索树问题提出一种新的优化模型，并结合人工神经网络技术加以解决。
The previous research on B&B algorithm focused on simplifying the search tree in order to reduce the search complexity, and several improvements have already existed.
对B&B算法的研究集中在化简搜索树从而降低搜索复杂度上，提出了几种改进的B&B算法。
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实现一个这样的数据结构并不是很方便，并且是不必要的。
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）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
应用推荐