1、The algorithm provides the possibility of reducing the size of the search tree and running time.
該算法從理論上提供了減小搜索樹(shù)的規(guī)模及運(yùn)行時(shí)間的可能性。

2、In this paper, the study of random binary search tree is a random graph theories of a tree.
本文所研究的隨機(jī)二叉搜索樹(shù)是隨機(jī)圖論二叉樹(shù)的一種。

3、It maintains the free space in heap as nodes in a Cartesian binary search tree format.
它按照Cartesian二分法檢索樹(shù)格式以節(jié)點(diǎn)的形式維護(hù)堆中的空閑空間。

4、A binary search tree is a binary tree with the following properties.
二進(jìn)制搜索樹(shù)(BST)是具有以下屬性的二進(jìn)制樹(shù)。

5、The gridding arithmetic of search tree of robotic path is derived.
同時(shí)，還推導(dǎo)了機(jī)器人路徑搜索樹(shù)網(wǎng)格算法。

search tree翻譯