Remove -> None for Python functions

codes/python/chapter_tree/avl_tree.py

@@ -88,7 +88,7 @@ class AVLTree:
         # 平衡树，无需旋转，直接返回
         return node
 
-    def insert(self, val) -> None:
+    def insert(self, val):
         """插入节点"""
         self.root = self.__insert_helper(self.root, val)
 
@@ -109,7 +109,7 @@ class AVLTree:
         # 2. 执行旋转操作，使该子树重新恢复平衡
         return self.__rotate(node)
 
-    def remove(self, val: int) -> None:
+    def remove(self, val: int):
         """删除节点"""
         self.root = self.__remove_helper(self.root, val)
 

codes/python/chapter_tree/binary_search_tree.py

@@ -13,7 +13,7 @@ from modules import *
 class BinarySearchTree:
     """二叉搜索树"""
 
-    def __init__(self, nums: list[int]) -> None:
+    def __init__(self, nums: list[int]):
         """构造方法"""
         nums.sort()
         self.root = self.build_tree(nums, 0, len(nums) - 1)
@@ -53,7 +53,7 @@ class BinarySearchTree:
                 break
         return cur
 
-    def insert(self, num: int) -> None:
+    def insert(self, num: int):
         """插入节点"""
         # 若树为空，直接提前返回
         if self.root is None:
@@ -80,7 +80,7 @@ class BinarySearchTree:
         else:
             pre.left = node
 
-    def remove(self, num: int) -> None:
+    def remove(self, num: int):
         """删除节点"""
         # 若树为空，直接提前返回
         if self.root is None:

codes/python/chapter_tree/binary_tree_dfs.py

@@ -10,7 +10,7 @@ sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
 from modules import *
 
 
-def pre_order(root: TreeNode | None) -> None:
+def pre_order(root: TreeNode | None):
     """前序遍历"""
     if root is None:
         return
@@ -20,7 +20,7 @@ def pre_order(root: TreeNode | None) -> None:
     pre_order(root=root.right)
 
 
-def in_order(root: TreeNode | None) -> None:
+def in_order(root: TreeNode | None):
     """中序遍历"""
     if root is None:
         return
@@ -30,7 +30,7 @@ def in_order(root: TreeNode | None) -> None:
     in_order(root=root.right)
 
 
-def post_order(root: TreeNode | None) -> None:
+def post_order(root: TreeNode | None):
     """后序遍历"""
     if root is None:
         return