gen-define-a-balanced-tree-rotation-and-give-one-short-worked-ex-6aa4

Define a balanced tree rotation and give one short worked example.

# Balanced Tree Rotation A **tree rotation** is a local restructuring operation that changes the arrangement of nodes while preserving the binary search tree property (in-order traversal remains the same). It's used to rebalance trees when they become skewed. ## Types - **Right rotation**: Used when left subtree is too heavy - **Left rotation**: Used when right subtree is too heavy ## Right Rotation Example **Before rotation** (unbalanced, left-heavy at node 30): ``` 30 / 20 / 10 ``` **After right rotation on 30:** ``` 20 / \ 10 30 ``` **Steps:** 1. Node 20 becomes the new root 2. Node 30 becomes 20's right child 3. If 20 had a right child, it would become 30's left child (none in this case) **Result:** The tree is now balanced (height reduced from 3 to 2), and BST property is maintained: 10 < 20 < 30.