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

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

youdao

Done. All right? The basic, that primary search, because it looks at the first element, says it's smaller than everything else, I'm done.

以及其他的元素，检索完成，让我试试二分法呢？,可能会用更长的时间，请注意这里的输出。

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

In binary search-- ah, there's that wonderful phrase, this is called a version of binary search just like you saw bin-- or bi-section methods, - when we were doing numerical things- in binary search, I need to keep track of the starting point and the ending point of the list I'm looking at.

就是当我们处理数字的时候，所称的二分检索，在二分法搜索中,我需要记录区间的开始点和尾点，初始化的时候就是-,问题输入的开始点和尾点，当我开始做测试的时候,我想要做的就是去取中值点。

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