Question: Which of the following is true about the performance of AVL trees?

Options:

1. Faster than Red-Black Trees for all operations
2. Slower than Red-Black Trees for all operations
3. Faster for search operations but slower for insertions
4. Slower for search operations but faster for insertions

Correct Answer: Faster for search operations but slower for insertions

Solution:

AVL trees provide faster search operations due to their stricter balancing, but they can be slower for insertions and deletions because they may require more rotations.