It maintains the free space in heap as nodes in a Cartesian binary search tree format. 它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。
Red-black tree is a self-balancing binary search tree. 红黑树是一个自平衡的二叉查找树。
Unlike other self-balancing binary search trees that provide worst case O ( log n ) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree. 和其它的提供了最坏情况O(logn)查找时间的自平衡二分查找树不同,替罪羊树与普通的二分查找树相比,并没有对每个节点增加额外的开销。
A scapegoat tree is a self-balancing binary search tree, that provides worst-case O ( log n ) lookup time, and O ( log n ) amortized insertion and deletion time. 替罪羊树是一种自平衡的二分查找树,它提供了最坏情况下的O(logn)查找时间,以及O(logn)的分期插入和删除时间。
Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem. 用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。