How do I implement tree rotation in a binary search tree?

How do I implement tree rotation in a binary search tree?

Tree rotation is a technique used to maintain the balance of a binary search tree. Would you like to know about left or right rotation first?

Let's start with left rotation.

In a left rotation, you take a node and make its right child the new root of the subtree. The original root becomes the left child of the new root. Would you like a code example?

Yes, please provide a code example for left rotation.

Here's a simple implementation in Python:

class Node:
    def __init__(self, key):
        self.left = None
        self.right = None
        self.val = key

def left_rotate(root):
    new_root = root.right
    root.right = new_root.left
    new_root.left = root
    return new_root

This function takes a node and performs a left rotation.

What about right rotation?

Right rotation is similar but in the opposite direction. Would you like to see that as well?