| 1. | On the subtrees of random binary search trees
随机二叉搜索树的子树 |
| 2. | A binary search tree is a binary tree with the following properties
二进制搜索树( bst )是具有以下属性的二进制树： |
| 3. | Binary search trees are useful for finding items in a list that changes infrequently
二叉搜索树在查找经常变化的列表时是很非常有用的。 |
| 4. | The algorithm provides the possibility of reducing the size of the search tree and running time
该算法从理论上提供了减小搜索树的规模及运行时间的可能性。 |
| 5. | Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
二叉搜索树在查找经常变化的列表时是很非常有用的。 |
| 6. | Search tree , which is restricted by search depth , is the traditional algorithm in dealing with game
摘要解决博弈问题的传统算法搜索树法所无法克服的对搜索深度的限制。 |
| 7. | The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree
实验表明，用遗传算法所设计的对弈程序优于搜索树法。 |
| 8. | 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
在此基础上，信息的搜索就可描述为二进制搜索树的查找过程。 |
| 9. | 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
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。 |
| 10. | 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
为了提高识别时的速度，从理论上提出了一种基于搜索树的识别模型，并对其可行性进行了一定的验证。 |
