It maintains the free space in heap as nodes in a Cartesian binary search tree format.

它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。

youdao

A binary search tree (BST) is a binary tree with the following properties.

二进制搜索树(BST)是具有以下属性的二进制树。

youdao

OK. That's the basic idea of binary search.

好了，这就是二分查找的基本思想。

youdao

So binary search, the phonebook example, binary search on the pieces of paper on the white board, why is that?

是二分查找，例如电话簿的例子,对其中的某一页进行二分查找，为什么呢？

哈佛公开课 - 计算机科学课程节选

We started off talking about binary search, and I suggested that this was a log algorithm which it is, which is really kind of nice.

我告诉了你们这是一个对，数级的算法，这是很棒的,我们来一起看看这个算法到底做了什么。

麻省理工公开课 - 计算机科学及编程导论课程节选

OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.

好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。

麻省理工公开课 - 计算机科学及编程导论课程节选