We show how a few modifications to the red–black trees allow for constant worst-case update time (once the position of the element to be inserted or deleted is known). The resulting structure is based on relaxing some of the properties of the red–black trees while guaranteeing that the height remains logarithmic with respect to the number of nodes. Compared to the other search trees with constant worst-case update time, our tree is the first to provide a tailored deletion procedure without using the global rebuilding technique. In addition, our procedures are simpler and allow for an easier proof of correctness than those alternative trees.

中文翻译：

---

具有恒定更新时间的红黑树

我们展示了对红黑树的一些修改如何允许恒定的最坏情况更新时间（一旦要插入或删除的元素的位置已知）。由此产生的结构基于放宽红黑树的一些属性，同时保证高度相对于节点数量保持对数。与具有恒定最坏情况更新时间的其他搜索树相比，我们的树是第一个提供定制删除程序而不使用全局重建技术的树。此外，我们的程序更简单，并且比那些替代树更容易证明正确性。