In an AVL tree, at what condition the balancing factor of any node can become more than 1?

In an AVL (Adelson-Velsky and Landis) tree, the balancing factor of any node can become more than 1 when the height of the left subtree is more than one greater than the height of the right subtree.

Here are the steps to understand this:

1. The balancing factor of a node in an AVL tree is the difference between the height of the left subtree and the height of the right subtree of that node.

2. The height of a subtree is the number of edges on the longest path from the root to a leaf.

3. In an AVL tree, it is required that the balancing factor of every node is either -1, 0, or 1.

4. If the balancing factor of any node is not in the set {-1, 0, 1}, then the AVL tree property is violated.

5. Therefore, if the balancing factor of any node becomes more than 1, it means that the height of the left subtree is more than one greater than the height of the right subtree. This violates the AVL tree property, and rotations must be performed to bring the tree back into balance.