Red-Black Trees Operation

红黑树- 插入、删除 流程详解，末尾附完整代码，及高清过程图_添加的过程讲解完毕。改天在跟大家讲删除-CSDN博客

Insertion

Deletion

Number of rotations

• When using insertion, AVL trees are recommended.

Problem

1

In the worst case the DELETE operation in a RED-BLACK tree of n nodes requires Ω(logn) rotations.

F.

rotation最多3次就可以了