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

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

youdao

结果表明，它比二元查找树更为有效。

The results show that it is more effective than the binary search tree.

youdao

添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。

Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.

youdao