Which of the following is true about the balancing of AVL trees?

Which of the following is true about the balancing of AVL trees?

Step 1: Understand what an AVL tree is. An AVL tree is a type of binary search tree that keeps itself balanced.
Step 2: Learn about the balance factor. The balance factor of a node in an AVL tree is the difference between the heights of its left and right subtrees.
Step 3: Know the allowed range for the balance factor. In an AVL tree, the balance factor must be -1, 0, or 1.
Step 4: Recognize that when you insert or delete a node, the balance factor can change and may go outside the allowed range.
Step 5: Understand that to fix the balance factor, you may need to perform rotations. Rotations are operations that rearrange the nodes to restore balance.
Step 6: Remember that there are different types of rotations: single right rotation, single left rotation, double right-left rotation, and double left-right rotation.

No concepts available.