What happens when an AVL tree becomes unbalanced after an insertion?

What happens when an AVL tree becomes unbalanced after an insertion?

Step 1: Insert the new node into the AVL tree as you would in a regular binary search tree.
Step 2: After the insertion, check the balance factor of each node starting from the newly inserted node up to the root.
Step 3: The balance factor is calculated as the height of the left subtree minus the height of the right subtree.
Step 4: If the balance factor of any node is greater than 1 or less than -1, the tree is unbalanced.
Step 5: Determine the type of imbalance (Left-Left, Left-Right, Right-Right, Right-Left) based on the balance factors of the affected nodes.
Step 6: Perform the appropriate rotation (single or double) to restore balance to the AVL tree.

No concepts available.