Binary Search Tree (BST) Rotations

Introduction

BST rotations are operations that help maintain the balance of a tree in self-balancing BSTs like AVL and Red-Black trees.

Types of Rotations

• Left Rotation: Moves a node down to the left, balancing a right-heavy subtree.
• Right Rotation: Moves a node down to the right, balancing a left-heavy subtree.
• Double Rotations: A combination of left and right rotations (Left-Right and Right-Left) to fix imbalances.

Visual Representation

Learn More

For more details, visit this Wikipedia page.