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

中文解释

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