Question: Which of the following is a characteristic of AVL trees?

Options:

1. They can have a maximum height of log(n)
2. They allow duplicate values
3. They are always complete binary trees
4. They require less memory than Red-Black trees

Correct Answer: They can have a maximum height of log(n)

Solution:

AVL trees maintain a height of log(n) for n nodes, ensuring efficient operations.