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

Of course, we all have our own bursting point, when under emotional stress we can no longer contain ourselves, says Sharon Gilchrest O'Neill, a Mount Kisco, N.

WSJ: What Makes People Overshare?