Which of the following operations can cause an imbalance in an AVL tree?

Which of the following operations can cause an imbalance in an AVL tree?

Step 1: Understand what an AVL tree is. An AVL tree is a type of binary search tree that maintains a balance to ensure efficient operations.
Step 2: Know that an AVL tree has a balance factor for each node, which is the difference between the heights of the left and right subtrees.
Step 3: Learn that when you insert a new node, it can change the heights of the subtrees and potentially make the tree unbalanced.
Step 4: Recognize that when you delete a node, it can also change the heights of the subtrees, leading to an imbalance.
Step 5: Conclude that both insertion and deletion can cause an imbalance in an AVL tree, which means the tree may need to be rebalanced.

No concepts available.