What are some examples of tree rotations in data structures?

What are some examples of tree rotations in data structures?

Tree rotations are operations that change the structure of a binary tree while preserving its in-order sequence. Common examples include left rotation and right rotation.

Can you explain left rotation with an example?

Sure! In a left rotation, the right child of a node becomes the new root of the subtree, and the original root becomes the left child of the new root.

What about right rotation?

In a right rotation, the left child of a node becomes the new root of the subtree, and the original root becomes the right child of the new root.

When are these rotations typically used?

These rotations are typically used in self-balancing binary search trees like AVL trees and Red-Black trees to maintain balance after insertions or deletions.