diff --git a/chapter_computational_complexity/index.md b/chapter_computational_complexity/index.md
index bb7b1dda2..980bd00e8 100644
--- a/chapter_computational_complexity/index.md
+++ b/chapter_computational_complexity/index.md
@@ -2,10 +2,10 @@
 comments: true
 ---
 
-# 2.   复杂度分析
+# 2.   复杂度
 
 <div class="center-table" markdown>
 
-![复杂度分析](../assets/covers/chapter_complexity_analysis.jpg){ width="70%" }
+![复杂度](../assets/covers/chapter_complexity_analysis.jpg){ width="70%" }
 
 </div>
diff --git a/chapter_data_structure/index.md b/chapter_data_structure/index.md
index 1f0ef845a..ef22722a2 100644
--- a/chapter_data_structure/index.md
+++ b/chapter_data_structure/index.md
@@ -2,7 +2,7 @@
 comments: true
 ---
 
-# 3. &nbsp; 数据结构简介
+# 3. &nbsp; 数据结构
 
 <div class="center-table" markdown>
 
diff --git a/chapter_tree/avl_tree.md b/chapter_tree/avl_tree.md
index 0686ce1e1..61d880e4a 100644
--- a/chapter_tree/avl_tree.md
+++ b/chapter_tree/avl_tree.md
@@ -1450,7 +1450,7 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
     ```python title="avl_tree.py"
     def insert(self, val) -> None:
         """插入节点"""
-        self.__root = self.__insert_helper(self.__root, val)
+        self.root = self.__insert_helper(self.root, val)
 
     def __insert_helper(self, node: TreeNode | None, val: int) -> TreeNode:
         """递归插入节点（辅助方法）"""
@@ -1800,7 +1800,7 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
     ```python title="avl_tree.py"
     def remove(self, val: int) -> None:
         """删除节点"""
-        self.__root = self.__remove_helper(self.__root, val)
+        self.root = self.__remove_helper(self.root, val)
 
     def __remove_helper(self, node: TreeNode | None, val: int) -> TreeNode | None:
         """递归删除节点（辅助方法）"""
diff --git a/chapter_tree/binary_search_tree.md b/chapter_tree/binary_search_tree.md
index 80b27fc75..75ededf53 100755
--- a/chapter_tree/binary_search_tree.md
+++ b/chapter_tree/binary_search_tree.md
@@ -804,7 +804,7 @@ comments: true
                     pre.right = child
             else:
                 # 若删除节点为根节点，则重新指定根节点
-                self.__root = child
+                self.root = child
         # 子节点数量 = 2
         else:
             # 获取中序遍历中 cur 的下一个节点