见 www.geeksforgeeks.org/red-black-t…
| rb | avl | |
|---|---|---|
| 插入/删除 | provide faster insertion and removal operations than AVL trees as fewer rotations are done due to relatively relaxed balancing. | |
| 查询 | provide faster lookups than Red-Black Trees because they are more strictly balanced | |
| 存储 | requires only 1 bit of extra information per node. | store balance factors or heights with each node thus requiring storage for an integer per node. |
| 用途 | Red-Black Trees are used in most of the language libraries like map, multimap, multiset in C++, etc. | AVL trees are used in databases where faster retrievals are required. |
