searching tree造句

• On the subtrees of random binary search trees
  随机二叉搜索树的子树
• A binary search tree is a binary tree with the following properties
  二进制搜索树( bst )是具有以下属性的二进制树：
• Digital search tree
  数字查找树
• Binary search tree
  二叉查找树
• Binary search trees are useful for finding items in a list that changes infrequently
  二叉搜索树在查找经常变化的列表时是很非常有用的。
• The algorithm provides the possibility of reducing the size of the search tree and running time
  该算法从理论上提供了减小搜索树的规模及运行时间的可能性。
• Add and remove operations are typically expensive since binary search trees require that a tree be balanced
  通常需要增加和删除操作，因为二叉树需要被平衡。
• Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
  二叉搜索树在查找经常变化的列表时是很非常有用的。
• Search tree , which is restricted by search depth , is the traditional algorithm in dealing with game
  摘要解决博弈问题的传统算法搜索树法所无法克服的对搜索深度的限制。
• The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree
  实验表明，用遗传算法所设计的对弈程序优于搜索树法。
• The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the 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
  用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
• In the paper , an extended generalized search tree ( egist ) is presented to support the extensibility of data types and query predicates
  为此，本文提出了一种扩展的通用索引树结构egist ，来支持数据类型和查询谓词两方面的可扩展性要求。
• In order to make the recognition rapid a recognition model based on searching tree is proposed lots of experiments on it were done and the results proved what we proposed is possible
  为了提高识别时的速度，从理论上提出了一种基于搜索树的识别模型，并对其可行性进行了一定的验证。
• 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实现一个这样的数据结构并不是很方便，并且是不必要的。
• In the algorithm , a search tree with roots of the cumulative demands in the corresponding period is taken as the roots of the search tree , transforming the quantity discount problem into dynamic order quantity ( doq ) problem that is solvable with a dynamic programming algorithm
  该算法以各时段的累计需求为根节点建立搜索树，从而将带折扣的库存问题转化为典型的动态批量问题，运用动态规划法即可求解。
• Taking gobang as an example , this paper proposes the base scheme for solve game problem by adopting the notion of genetic algorithms instead of search tree , and makes some exploratory work on the design of fitness function , it also provides with requirements for designing fitness function
  以五子棋为例，提出了用遗传算法代替搜索树法解决博弈问题的基本方案，并对适应度函数的设计作了一些有益地探索，给出了设计适应度函数应满足的必要条件。
• Topics covered include : sorting ; search trees , heaps , and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing
  课程主题包含了：排序、搜寻树、堆积及杂凑；各个击破法、动态规划、摊提分析、图论演算法、最短路径、网路流量、计算几何、数论演算法；多项式及矩阵的运算；快取及平行计算。
• Topics covered include : sorting ; search trees , heaps , and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing
  课程主题包含了：排序、搜寻树、堆积及散列；各个击破法、动态规划、摊提分析、图论算法、最短路径、网络流量、计算几何、数论算法；多项式及矩阵的运算；高速缓存技术及并行运算。