Which of the following statements about AVL and Red-Black trees is true?

Which of the following statements about AVL and Red-Black trees is true?

Step 1: Understand what AVL trees and Red-Black trees are. They are both types of self-balancing binary search trees used in computer science.
Step 2: Learn that AVL trees maintain a stricter balance than Red-Black trees. This means that the height difference between the left and right subtrees of any node in an AVL tree is at most 1.
Step 3: Recognize that because of this stricter balancing, AVL trees can perform lookups (searching for a value) faster than Red-Black trees.
Step 4: Understand that Red-Black trees are less strict in their balancing, which allows them to perform insertions and deletions more efficiently than AVL trees.
Step 5: Conclude that while AVL trees are better for lookups, Red-Black trees are better for insertions and deletions.

No concepts available.