January 2019
Intermediate to advanced
316 pages
8h 8m
English
Content preview from Hands-On Data Structures and Algorithms with Rust
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Upsides
A red-black tree has a few desirable properties over a regular binary search tree:
- Balance makes searches consistently fast
- Predictable, low-memory usage
- Inserts are reasonably fast
- Simplicity of a binary tree
- Easy to validate
However, the data structure has some significant downsides as well, especially when planning to implement it!