Hands-On Data Structures and Algorithms with Rust

Downsides

Speed is great, but can your implementation achieve it? Let's have a look at the downsides of red-black trees:

• Complex implementation, especially in Rust
• Concurrent writes require the entire tree to be locked
• Performance is great compared to binary search trees, but other trees perform better at the same complexity
• Skip lists (from the previous chapter) perform similarly with better concurrency and simpler implementations

In any case, the red-black tree is a great journey into sophisticated binary tree structures. A more exotic binary tree structure is the heap (not to be confused with the portion of main memory).