Which of the following statements is true regarding the balancing of AVL trees?
-
They require fewer rotations than Red-Black trees
-
They are always balanced after every insertion
-
They can become unbalanced after deletion
-
They do not require balancing at all