python实现平衡二叉树算法的代码

平衡二叉树(Balanced Binary Tree)是指一棵二叉树，其中任意节点的两棵子树的高度差不超过 1。常见的平衡二叉树有红黑树、AVL 树等。下面是一个用 Python 实现 AVL 树的简单示例代码：

``` class Node: def init(self, val): self.val = val self.left = None self.right = None self.height = 1

class AVLTree: def insert(self, root, key): # Step 1 - Perform normal BST if not root: return Node(key) elif key < root.val: root.left = self.insert(root.left, key) else: root.right = self.insert(root.right, key)

# Step2 - Update the height of the ancestor node
    root.height = 1 + max(self.getHeight(root.left), self.getHeight(root.right))

    # Step 3 - Get the balance factor
    balance = self.getBalance(root)

    # Step 4 - If the node is unbalanced, then try out the 4 cases
    # Case 1 - Left Left
    if balance > 1 and key < root.left.val:
        return self.rightRotate(root)

    # Case 2 - Right Right
    if balance < -1 and key > root.right.val:
        return self.leftRotate(root)

    # Case 3 - Left Right
    if balance > 1 and key > root.left.val:
        root.left = self.leftRotate(root.left)
        return self.rightRotate(root)

    # Case 4 - Right Left
    if balance < -1 and key < root.right.val:
        root.right = self.rightRotate(root.right)
        return self.leftRotate(root)

    return root

def leftRotate(self, z):
    y = z.right
    T2 = y.left

    # Perform rotation
    y.left = z
    z.right = T2

    # Update heights
    z.height = 1 + max(self.getHeight(z.left), self.getHeight(z.right))
    y.height = 1 + max(self.getHeight(y.left), self.getHeight(y.right))

    # Return the new root
    return y

def rightRotate(self, z):
    y = z.left
    T3 = y.right

    # Perform rotation
    y.right = z
    z.left = T3

    # Update heights
    z.height = 1 + max(self.getHeight(z.left), self.getHeight(z.right))
    y.height = 1 + max(self.getHeight(y.left), self.getHeight(y.right))

    # Return the new root