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

2、Red-black tree is a self-balancing binary search tree.
紅黑樹(shù)是一個(gè)自平衡的二叉查找樹(shù)。

3、Using this notation, you should know that search through a list is O and binary search is log.
看到這個(gè)標(biāo)記你就應(yīng)該知道搜索鏈表的復(fù)雜度為O(n)，進(jìn)行二進(jìn)制搜索時(shí)（已排序）的空間復(fù)雜度為log(n)。

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

5、Which search is faster, binary search or using prefix tree?
二進(jìn)制搜索或者搜索速度更快，使用前綴樹(shù)嗎？

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

7、This paper proposes a scheme of certificate revocation management based on binary search trees.
提出了一種基于二叉搜索樹(shù)的證書(shū)撤消管理方案。

8、Based on the analysis of binary search method, a new search method is put forward.
在分析二分搜索方法基礎(chǔ)上，提出了一種新的搜索方法。

9、How to use binary search to find the first non-null element in an array?
如何使用二進(jìn)制搜索來(lái)找到數(shù)組中第一個(gè)非空元素呢？

binary search翻譯