From 98e797f1fce495a7180862d6ca350c5a273878a1 Mon Sep 17 00:00:00 2001
From: krahets <krahets@163.com>
Date: Fri, 30 Jun 2023 05:09:17 +0800
Subject: [PATCH] Fix the bst python code. Fitune the chapters name.

---
 codes/python/chapter_tree/binary_search_tree.py | 2 +-
 mkdocs.yml                                      | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/codes/python/chapter_tree/binary_search_tree.py b/codes/python/chapter_tree/binary_search_tree.py
index 209cc0833..4384f817c 100644
--- a/codes/python/chapter_tree/binary_search_tree.py
+++ b/codes/python/chapter_tree/binary_search_tree.py
@@ -119,7 +119,7 @@ class BinarySearchTree:
                     pre.right = child
             else:
                 # 若删除节点为根节点，则重新指定根节点
-                self.__root = cur
+                self.__root = child
         # 子节点数量 = 2
         else:
             # 获取中序遍历中 cur 的下一个节点
diff --git a/mkdocs.yml b/mkdocs.yml
index 51a51bed7..a47f2c5f5 100644
--- a/mkdocs.yml
+++ b/mkdocs.yml
@@ -134,13 +134,13 @@ nav:
     - 1.1. &nbsp; 算法无处不在: chapter_introduction/algorithms_are_everywhere.md
     - 1.2. &nbsp; 算法是什么: chapter_introduction/what_is_dsa.md
     - 1.3. &nbsp; 小结: chapter_introduction/summary.md
-  - 2. &nbsp; &nbsp; 复杂度分析:
+  - 2. &nbsp; &nbsp; 复杂度:
     - chapter_computational_complexity/index.md
     - 2.1. &nbsp; 算法效率评估: chapter_computational_complexity/performance_evaluation.md
     - 2.2. &nbsp; 时间复杂度: chapter_computational_complexity/time_complexity.md
     - 2.3. &nbsp; 空间复杂度: chapter_computational_complexity/space_complexity.md
     - 2.4. &nbsp; 小结: chapter_computational_complexity/summary.md
-  - 3. &nbsp; &nbsp; 数据结构简介:
+  - 3. &nbsp; &nbsp; 数据结构:
     - chapter_data_structure/index.md
     - 3.1. &nbsp; 数据结构分类: chapter_data_structure/classification_of_data_structure.md
     - 3.2. &nbsp; 基本数据类型: chapter_data_structure/basic_data_types.md