Which of the following statements about AVL trees is true?
-
They can become unbalanced after every insertion
-
They require more rotations than Red-Black trees
-
They are always perfectly balanced
-
They are faster for search operations than Red-Black trees