Question: What is a key difference between AVL trees and Red-Black trees?
Options:
Correct Answer: AVL trees are faster for search operations
Solution:
AVL trees are generally faster for search operations due to their stricter balancing criteria, while Red-Black trees allow for faster insertion and deletion operations.