Comment on page
- Binary search trees are simple, but they are subject to imbalance which leads to crappy runtime. 2-3 Trees (B Trees) are balanced, but painful to implement.
- LLRB insertion is simple to implement (deletion is a bit harder to implement, we won't go over the specifics in this course).
- Use three basic operations to maintain the balanced structure, namely rotateLeft, rotateRight, and color flip.