AVL vs Red-Black tree — what’s the trade-off?

Answer

AVL trees keep stricter balance, so lookups are often faster, but inserts/deletes may require more rebalancing. Red-Black trees relax the balance rules, making updates cheaper while still keeping height O(log n).