[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/binary_search_tree.py

@@ -4,6 +4,7 @@
 from dataclasses import dataclass
 from typing import Any, Self
 
+
 @dataclass
 class Node:
     value: int
@@ -16,6 +17,7 @@ def __repr__(self) -> str:
             return str(self.value)
         return pformat({f"{self.value}": (self.left, self.right)}, indent=1)
 
+
 @dataclass
 class BinarySearchTree:
     root: Node | None = None
@@ -75,19 +77,23 @@ def remove(self, value: int) -> None:
             self.remove(predecessor.value)
             node.value = predecessor.value
 
+
 # 修复的递归函数
 def inorder(curr_node: Node | None) -> list[Node]:
     """Inorder traversal (left, self, right)"""
     if curr_node is None:
         return []
     return inorder(curr_node.left) + [curr_node] + inorder(curr_node.right)
 
+
 def postorder(curr_node: Node | None) -> list[Node]:
     """Postorder traversal (left, right, self)"""
     if curr_node is None:
         return []
     return postorder(curr_node.left) + postorder(curr_node.right) + [curr_node]
 
+
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod(verbose=True)