Which of the following statements is false regarding AVL trees?
-
They are a type of self-balancing binary search tree.
-
They can become unbalanced after insertion or deletion.
-
They require more rotations than Red-Black trees.
-
They can have duplicate values.
