[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/binary_tree/avl_tree.py

@@ -3,9 +3,10 @@
 import random
 from typing import Any
 
+
 class MyQueue:
     __slots__ = ("data", "head", "tail")
-    
+
     def __init__(self) -> None:
         self.data: list[Any] = []
         self.head = self.tail = 0
@@ -22,80 +23,79 @@ def pop(self) -> Any:
         self.head += 1
         return ret
 
+
 class MyNode:
     __slots__ = ("data", "height", "left", "right")
-    
+
     def __init__(self, data: Any) -> None:
         self.data = data
         self.height = 1
         self.left: MyNode | None = None
         self.right: MyNode | None = None
 
-def get_height(node: MyNode | None) -> int: 
+
+def get_height(node: MyNode | None) -> int:
     return node.height if node else 0
 
-def my_max(a: int, b: int) -> int: 
+
+def my_max(a: int, b: int) -> int:
     return a if a > b else b
 
+
 def right_rotation(node: MyNode) -> MyNode:
     left_child = node.left
     if left_child is None:
         return node
-    
+
     node.left = left_child.right
     left_child.right = node
-    
+
     # 拆分长表达式
-    node_height = my_max(
-        get_height(node.right), 
-        get_height(node.left)
-    ) + 1
+    node_height = my_max(get_height(node.right), get_height(node.left)) + 1
     node.height = node_height
-    
-    left_height = my_max(
-        get_height(left_child.right), 
-        get_height(left_child.left)
-    ) + 1
+
+    left_height = my_max(get_height(left_child.right), get_height(left_child.left)) + 1
     left_child.height = left_height
-    
+
     return left_child
+
+
 def left_rotation(node: MyNode) -> MyNode:
     right_child = node.right
     if right_child is None:
         return node
-    
+
     node.right = right_child.left
     right_child.left = node
-    
+
     # 拆分长表达式
-    node_height = my_max(
-        get_height(node.right), 
-        get_height(node.left)
-    ) + 1
+    node_height = my_max(get_height(node.right), get_height(node.left)) + 1
     node.height = node_height
-    
-    right_height = my_max(
-        get_height(right_child.right), 
-        get_height(right_child.left)
-    ) + 1
+
+    right_height = (
+        my_max(get_height(right_child.right), get_height(right_child.left)) + 1
+    )
     right_child.height = right_height
-    
+
     return right_child
 
+
 def lr_rotation(node: MyNode) -> MyNode:
     if node.left:
         node.left = left_rotation(node.left)
     return right_rotation(node)
 
+
 def rl_rotation(node: MyNode) -> MyNode:
     if node.right:
         node.right = right_rotation(node.right)
     return left_rotation(node)
 
+
 def insert_node(node: MyNode | None, data: Any) -> MyNode | None:
     if node is None:
         return MyNode(data)
-    
+
     if data < node.data:
         node.left = insert_node(node.left, data)
         if get_height(node.left) - get_height(node.right) == 2:
@@ -110,22 +110,21 @@ def insert_node(node: MyNode | None, data: Any) -> MyNode | None:
                 node = rl_rotation(node)
             else:
                 node = left_rotation(node)
-    
-    node.height = my_max(
-        get_height(node.right), 
-        get_height(node.left)
-    ) + 1
+
+    node.height = my_max(get_height(node.right), get_height(node.left)) + 1
     return node
 
+
 def get_left_most(root: MyNode) -> Any:
     while root.left:
         root = root.left
     return root.data
 
+
 def del_node(root: MyNode | None, data: Any) -> MyNode | None:
     if root is None:
         return None
-        
+
     if data == root.data:
         if root.left and root.right:
             root.data = get_left_most(root.right)
@@ -136,14 +135,14 @@ def del_node(root: MyNode | None, data: Any) -> MyNode | None:
         root.left = del_node(root.left, data)
     else:
         root.right = del_node(root.right, data)
-    
+
     if root.left is None and root.right is None:
         root.height = 1
         return root
-    
+
     left_height = get_height(root.left)
     right_height = get_height(root.right)
-    
+
     if right_height - left_height == 2:
         right_right = get_height(root.right.right) if root.right else 0
         right_left = get_height(root.right.left) if root.right else 0
@@ -152,38 +151,37 @@ def del_node(root: MyNode | None, data: Any) -> MyNode | None:
         left_left = get_height(root.left.left) if root.left else 0
         left_right = get_height(root.left.right) if root.left else 0
         root = right_rotation(root) if left_left > left_right else lr_rotation(root)
-    
-    root.height = my_max(
-        get_height(root.right), 
-        get_height(root.left)
-    ) + 1
+
+    root.height = my_max(get_height(root.right), get_height(root.left)) + 1
     return root
+
+
 class AVLTree:
     __slots__ = ("root",)
-    
-    def __init__(self) -> None: 
+
+    def __init__(self) -> None:
         self.root: MyNode | None = None
-        
-    def get_height(self) -> int: 
+
+    def get_height(self) -> int:
         return get_height(self.root)
-    
+
     def insert(self, data: Any) -> None:
         self.root = insert_node(self.root, data)
-    
+
     def delete(self, data: Any) -> None:
         self.root = del_node(self.root, data)
-    
+
     def __str__(self) -> str:
         if self.root is None:
             return ""
-            
+
         levels = []
         queue: list[MyNode | None] = [self.root]
-        
+
         while queue:
             current = []
             next_level: list[MyNode | None] = []
-            
+
             for node in queue:
                 if node:
                     current.append(str(node.data))
@@ -193,28 +191,30 @@ def __str__(self) -> str:
                     current.append("*")
                     next_level.append(None)
                     next_level.append(None)
-            
+
             if any(node is not None for node in next_level):
                 levels.append(" ".join(current))
                 queue = next_level
             else:
                 if current:
                     levels.append(" ".join(current))
                 break
-        
-        return "\n".join(levels) + "\n" + "*"*36
+
+        return "\n".join(levels) + "\n" + "*" * 36
+
 
 def test_avl_tree() -> None:
     t = AVLTree()
     lst = list(range(10))
     random.shuffle(lst)
-    
+
     for i in lst:
         t.insert(i)
-    
+
     random.shuffle(lst)
     for i in lst:
         t.delete(i)
 
+
 if __name__ == "__main__":
     test_avl_tree()