Red-black tree is a self-balancing binary search tree.

红黑树 是一个自平衡的二叉查找树。

youdao

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（log n） 查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。

youdao