<\/span><\/h2>\n\n\n\nIn this section we will be talking how we will able to implement AVL tree data structure in python.<\/p>\n\n\n\n
class Node:\n def __init__(self, key):\n self.key = key\n self.left = None\n self.right = None\n self.height = 1\n\nclass AVLTree:\n def get_height(self, node):\n if not node:\n return 0\n return node.height\n\n def get_balance(self, node):\n if not node:\n return 0\n return self.get_height(node.left) - self.get_height(node.right)\n\n def right_rotate(self, z):\n y = z.left\n T3 = y.right\n\n y.right = z\n z.left = T3\n\n z.height = 1 + max(self.get_height(z.left), self.get_height(z.right))\n y.height = 1 + max(self.get_height(y.left), self.get_height(y.right))\n return y\n\n def left_rotate(self, z):\n y = z.right\n T2 = y.left\n\n y.left = z\n z.right = T2\n\n z.height = 1 + max(self.get_height(z.left), self.get_height(z.right))\n y.height = 1 + max(self.get_height(y.left), self.get_height(y.right))\n return y\n\n def insert(self, root, key):\n if not root:\n return Node(key)\n elif key < root.key:\n root.left = self.insert(root.left, key)\n else:\n root.right = self.insert(root.right, key)\n\n root.height = 1 + max(self.get_height(root.left), self.get_height(root.right))\n balance = self.get_balance(root)\n\n # Left Left\n if balance > 1 and key < root.left.key:\n return self.right_rotate(root)\n\n # Right Right\n if balance < -1 and key > root.right.key:\n return self.left_rotate(root)\n\n # Left Right\n if balance > 1 and key > root.left.key:\n root.left = self.left_rotate(root.left)\n return self.right_rotate(root)\n\n # Right Left\n if balance < -1 and key < root.right.key:\n root.right = self.right_rotate(root.right)\n return self.left_rotate(root)\n\n return root\n\n def pre_order(self, root):\n if not root:\n return\n print(root.key, end=\" \")\n self.pre_order(root.left)\n self.pre_order(root.right)\n\n# Example usage\ntree = AVLTree()\nroot = None\n\nfor key in [10, 20, 30, 40, 50, 25]:\n root = tree.insert(root, key)\n\nprint(\"Preorder traversal of the constructed AVL tree:\")\ntree.pre_order(root)\n<\/code><\/pre>\n\n\n\n
![\"AVL](\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/06\/image-74.png\")
<\/a><\/figure><\/div>\n\n\n