How do you perform a left rotation on a node in an AVL tree?

How do you perform a left rotation on a node in an AVL tree?

Step 1: Identify the node that you want to perform the left rotation on. This node will be called 'X'.
Step 2: Identify the right child of node 'X'. This child will be called 'Y'.
Step 3: Make 'Y' the new root of the subtree. This means 'Y' will take the place of 'X'.
Step 4: Move the left child of 'Y' (if it exists) to be the right child of 'X'.
Step 5: Set 'X' as the left child of 'Y'.
Step 6: Update any parent pointers if necessary to maintain the structure of the AVL tree.

AVL Tree Rotations – Understanding how to perform rotations (left and right) to maintain balance in AVL trees.
Tree Structure Manipulation – Knowledge of how to adjust parent-child relationships in a binary tree.