diff --git a/docs/chapter_array_and_linkedlist/linked_list.md b/docs/chapter_array_and_linkedlist/linked_list.md
index 44dd1c036..76d9ec591 100755
--- a/docs/chapter_array_and_linkedlist/linked_list.md
+++ b/docs/chapter_array_and_linkedlist/linked_list.md
@@ -616,7 +616,7 @@ comments: true
 
     ```go title="linked_list.go"
     /* 删除链表的节点 n0 之后的首个节点 */
-    func removeNode(n0 *ListNode) {
+    func removeItem(n0 *ListNode) {
         if n0.Next == nil {
             return
         }
@@ -705,7 +705,7 @@ comments: true
     ```c title="linked_list.c"
     /* 删除链表的节点 n0 之后的首个节点 */
     // 注意：stdio.h 占用了 remove 关键词
-    void removeNode(ListNode *n0) {
+    void removeItem(ListNode *n0) {
         if (!n0->next)
             return;
         // n0 -> P -> n1
diff --git a/docs/chapter_divide_and_conquer/binary_search_recur.md b/docs/chapter_divide_and_conquer/binary_search_recur.md
index feab29242..e42e838eb 100644
--- a/docs/chapter_divide_and_conquer/binary_search_recur.md
+++ b/docs/chapter_divide_and_conquer/binary_search_recur.md
@@ -139,7 +139,7 @@ comments: true
 
     ```csharp title="binary_search_recur.cs"
     /* 二分查找：问题 f(i, j) */
-    int Dfs(int[] nums, int target, int i, int j) {
+    int DFS(int[] nums, int target, int i, int j) {
         // 若区间为空，代表无目标元素，则返回 -1
         if (i > j) {
             return -1;
@@ -148,10 +148,10 @@ comments: true
         int m = (i + j) / 2;
         if (nums[m] < target) {
             // 递归子问题 f(m+1, j)
-            return Dfs(nums, target, m + 1, j);
+            return DFS(nums, target, m + 1, j);
         } else if (nums[m] > target) {
             // 递归子问题 f(i, m-1)
-            return Dfs(nums, target, i, m - 1);
+            return DFS(nums, target, i, m - 1);
         } else {
             // 找到目标元素，返回其索引
             return m;
@@ -162,7 +162,7 @@ comments: true
     int BinarySearch(int[] nums, int target) {
         int n = nums.Length;
         // 求解问题 f(0, n-1)
-        return Dfs(nums, target, 0, n - 1);
+        return DFS(nums, target, 0, n - 1);
     }
     ```
 
diff --git a/docs/chapter_divide_and_conquer/build_binary_tree_problem.md b/docs/chapter_divide_and_conquer/build_binary_tree_problem.md
index a44ca274f..dedbfa0c9 100644
--- a/docs/chapter_divide_and_conquer/build_binary_tree_problem.md
+++ b/docs/chapter_divide_and_conquer/build_binary_tree_problem.md
@@ -172,7 +172,7 @@ comments: true
 
     ```csharp title="build_tree.cs"
     /* 构建二叉树：分治 */
-    TreeNode Dfs(int[] preorder, Dictionary<int, int> inorderMap, int i, int l, int r) {
+    TreeNode DFS(int[] preorder, Dictionary<int, int> inorderMap, int i, int l, int r) {
         // 子树区间为空时终止
         if (r - l < 0)
             return null;
@@ -181,9 +181,9 @@ comments: true
         // 查询 m ，从而划分左右子树
         int m = inorderMap[preorder[i]];
         // 子问题：构建左子树
-        root.left = Dfs(preorder, inorderMap, i + 1, l, m - 1);
+        root.left = DFS(preorder, inorderMap, i + 1, l, m - 1);
         // 子问题：构建右子树
-        root.right = Dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r);
+        root.right = DFS(preorder, inorderMap, i + 1 + m - l, m + 1, r);
         // 返回根节点
         return root;
     }
@@ -195,7 +195,7 @@ comments: true
         for (int i = 0; i < inorder.Length; i++) {
             inorderMap.TryAdd(inorder[i], i);
         }
-        TreeNode root = Dfs(preorder, inorderMap, 0, 0, inorder.Length - 1);
+        TreeNode root = DFS(preorder, inorderMap, 0, 0, inorder.Length - 1);
         return root;
     }
     ```
diff --git a/docs/chapter_divide_and_conquer/hanota_problem.md b/docs/chapter_divide_and_conquer/hanota_problem.md
index d5dcc2d40..dafea8148 100644
--- a/docs/chapter_divide_and_conquer/hanota_problem.md
+++ b/docs/chapter_divide_and_conquer/hanota_problem.md
@@ -208,25 +208,25 @@ comments: true
     }
 
     /* 求解汉诺塔：问题 f(i) */
-    void Dfs(int i, List<int> src, List<int> buf, List<int> tar) {
+    void DFS(int i, List<int> src, List<int> buf, List<int> tar) {
         // 若 src 只剩下一个圆盘，则直接将其移到 tar
         if (i == 1) {
             Move(src, tar);
             return;
         }
         // 子问题 f(i-1) ：将 src 顶部 i-1 个圆盘借助 tar 移到 buf
-        Dfs(i - 1, src, tar, buf);
+        DFS(i - 1, src, tar, buf);
         // 子问题 f(1) ：将 src 剩余一个圆盘移到 tar
         Move(src, tar);
         // 子问题 f(i-1) ：将 buf 顶部 i-1 个圆盘借助 src 移到 tar
-        Dfs(i - 1, buf, src, tar);
+        DFS(i - 1, buf, src, tar);
     }
 
     /* 求解汉诺塔 */
     void SolveHanota(List<int> A, List<int> B, List<int> C) {
         int n = A.Count;
         // 将 A 顶部 n 个圆盘借助 B 移到 C
-        Dfs(n, A, B, C);
+        DFS(n, A, B, C);
     }
     ```
 
diff --git a/docs/chapter_dynamic_programming/intro_to_dynamic_programming.md b/docs/chapter_dynamic_programming/intro_to_dynamic_programming.md
index 171a75f9a..bf1cd4260 100644
--- a/docs/chapter_dynamic_programming/intro_to_dynamic_programming.md
+++ b/docs/chapter_dynamic_programming/intro_to_dynamic_programming.md
@@ -472,18 +472,18 @@ $$
 
     ```csharp title="climbing_stairs_dfs.cs"
     /* 搜索 */
-    int Dfs(int i) {
+    int DFS(int i) {
         // 已知 dp[1] 和 dp[2] ，返回之
         if (i == 1 || i == 2)
             return i;
         // dp[i] = dp[i-1] + dp[i-2]
-        int count = Dfs(i - 1) + Dfs(i - 2);
+        int count = DFS(i - 1) + DFS(i - 2);
         return count;
     }
 
     /* 爬楼梯：搜索 */
     int ClimbingStairsDFS(int n) {
-        return Dfs(n);
+        return DFS(n);
     }
     ```
 
@@ -736,7 +736,7 @@ $$
 
     ```csharp title="climbing_stairs_dfs_mem.cs"
     /* 记忆化搜索 */
-    int Dfs(int i, int[] mem) {
+    int DFS(int i, int[] mem) {
         // 已知 dp[1] 和 dp[2] ，返回之
         if (i == 1 || i == 2)
             return i;
@@ -744,7 +744,7 @@ $$
         if (mem[i] != -1)
             return mem[i];
         // dp[i] = dp[i-1] + dp[i-2]
-        int count = Dfs(i - 1, mem) + Dfs(i - 2, mem);
+        int count = DFS(i - 1, mem) + DFS(i - 2, mem);
         // 记录 dp[i]
         mem[i] = count;
         return count;
@@ -755,7 +755,7 @@ $$
         // mem[i] 记录爬到第 i 阶的方案总数，-1 代表无记录
         int[] mem = new int[n + 1];
         Array.Fill(mem, -1);
-        return Dfs(n, mem);
+        return DFS(n, mem);
     }
     ```
 
diff --git a/docs/chapter_graph/graph_traversal.md b/docs/chapter_graph/graph_traversal.md
index f396ab5c4..1406cbefa 100644
--- a/docs/chapter_graph/graph_traversal.md
+++ b/docs/chapter_graph/graph_traversal.md
@@ -532,7 +532,7 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
 
     ```csharp title="graph_dfs.cs"
     /* 深度优先遍历 DFS 辅助函数 */
-    void Dfs(GraphAdjList graph, HashSet<Vertex> visited, List<Vertex> res, Vertex vet) {
+    void DFS(GraphAdjList graph, HashSet<Vertex> visited, List<Vertex> res, Vertex vet) {
         res.Add(vet);     // 记录访问顶点
         visited.Add(vet); // 标记该顶点已被访问
         // 遍历该顶点的所有邻接顶点
@@ -541,7 +541,7 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
                 continue; // 跳过已被访问过的顶点                             
             }
             // 递归访问邻接顶点
-            Dfs(graph, visited, res, adjVet);
+            DFS(graph, visited, res, adjVet);
         }
     }
 
@@ -552,7 +552,7 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
         List<Vertex> res = new();
         // 哈希表，用于记录已被访问过的顶点
         HashSet<Vertex> visited = new();
-        Dfs(graph, visited, res, startVet);
+        DFS(graph, visited, res, startVet);
         return res;
     }
     ```
diff --git a/docs/chapter_stack_and_queue/deque.md b/docs/chapter_stack_and_queue/deque.md
index 04134da7d..f4fb66e6d 100644
--- a/docs/chapter_stack_and_queue/deque.md
+++ b/docs/chapter_stack_and_queue/deque.md
@@ -1760,7 +1760,7 @@ comments: true
             node->next = deque->front;
             deque->front = node; // 更新头节点
         }
-        // 对尾入队操作
+        // 队尾入队操作
         else {
             // 将 node 添加至链表尾部
             deque->rear->next = node;
diff --git a/docs/chapter_tree/array_representation_of_tree.md b/docs/chapter_tree/array_representation_of_tree.md
index 5797ff31a..ab28115e7 100644
--- a/docs/chapter_tree/array_representation_of_tree.md
+++ b/docs/chapter_tree/array_representation_of_tree.md
@@ -458,18 +458,18 @@ comments: true
         }
 
         /* 深度优先遍历 */
-        private void Dfs(int i, string order, List<int> res) {
+        private void DFS(int i, string order, List<int> res) {
             // 若为空位，则返回
             if (!Val(i).HasValue)
                 return;
             // 前序遍历
             if (order == "pre")
                 res.Add(Val(i).Value);
-            Dfs(Left(i), order, res);
+            DFS(Left(i), order, res);
             // 中序遍历
             if (order == "in")
                 res.Add(Val(i).Value);
-            Dfs(Right(i), order, res);
+            DFS(Right(i), order, res);
             // 后序遍历
             if (order == "post")
                 res.Add(Val(i).Value);
@@ -478,21 +478,21 @@ comments: true
         /* 前序遍历 */
         public List<int> PreOrder() {
             List<int> res = new();
-            Dfs(0, "pre", res);
+            DFS(0, "pre", res);
             return res;
         }
 
         /* 中序遍历 */
         public List<int> InOrder() {
             List<int> res = new();
-            Dfs(0, "in", res);
+            DFS(0, "in", res);
             return res;
         }
 
         /* 后序遍历 */
         public List<int> PostOrder() {
             List<int> res = new();
-            Dfs(0, "post", res);
+            DFS(0, "post", res);
             return res;
         }
     }
diff --git a/docs/chapter_tree/avl_tree.md b/docs/chapter_tree/avl_tree.md
index e6becdc29..6f4cf916c 100644
--- a/docs/chapter_tree/avl_tree.md
+++ b/docs/chapter_tree/avl_tree.md
@@ -2361,7 +2361,7 @@ AVL 树的节点插入操作与二叉搜索树在主体上类似。唯一的区
     ```c title="avl_tree.c"
     /* 删除节点 */
     // 由于引入了 stdio.h ，此处无法使用 remove 关键词
-    void removeNode(aVLTree *tree, int val) {
+    void removeItem(aVLTree *tree, int val) {
         TreeNode *root = removeHelper(tree->root, val);
     }
 
diff --git a/docs/chapter_tree/binary_search_tree.md b/docs/chapter_tree/binary_search_tree.md
index 0dee29a9f..5f2f1c064 100755
--- a/docs/chapter_tree/binary_search_tree.md
+++ b/docs/chapter_tree/binary_search_tree.md
@@ -1357,7 +1357,7 @@ comments: true
     ```c title="binary_search_tree.c"
     /* 删除节点 */
     // 由于引入了 stdio.h ，此处无法使用 remove 关键词
-    void removeNode(binarySearchTree *bst, int num) {
+    void removeItem(binarySearchTree *bst, int num) {
         // 若树为空，直接提前返回
         if (bst->root == NULL)
             return;
@@ -1399,7 +1399,7 @@ comments: true
             }
             int tmpVal = tmp->val;
             // 递归删除节点 tmp
-            removeNode(bst, tmp->val);
+            removeItem(bst, tmp->val);
             // 用 tmp 覆盖 cur
             cur->val = tmpVal;
         }