Fix graph_operations.md and binary_tree_traversal.md

docs/chapter_graph/graph_operations.md

@@ -89,7 +89,7 @@ comments: true
 === "Zig"
 
     ```zig title="graph_adjacency_matrix.zig"
-    
+
     ```
 
 ## 9.2.2. 基于邻接表的实现
@@ -128,80 +128,60 @@ comments: true
 === "Java"
 
     ```java title="graph_adjacency_list.java"
-    [class]{Vertex}-[func]{}
-
     [class]{GraphAdjList}-[func]{}
     ```
 
 === "C++"
 
     ```cpp title="graph_adjacency_list.cpp"
-    [class]{Vertex}-[func]{}
-
     [class]{GraphAdjList}-[func]{}
     ```
 
 === "Python"
 
     ```python title="graph_adjacency_list.py"
-    [class]{Vertex}-[func]{}
-
     [class]{GraphAdjList}-[func]{}
     ```
 
 === "Go"
 
     ```go title="graph_adjacency_list.go"
-    [class]{vertex}-[func]{}
-
     [class]{graphAdjList}-[func]{}
     ```
 
 === "JavaScript"
 
     ```javascript title="graph_adjacency_list.js"
-    [class]{Vertex}-[func]{}
-
     [class]{GraphAdjList}-[func]{}
     ```
 
 === "TypeScript"
 
     ```typescript title="graph_adjacency_list.ts"
-    [class]{Vertex}-[func]{}
-
     [class]{GraphAdjList}-[func]{}
     ```
 
 === "C"
 
     ```c title="graph_adjacency_list.c"
-    [class]{vertex}-[func]{}
-
     [class]{graphAdjList}-[func]{}
     ```
 
 === "C#"
 
     ```csharp title="graph_adjacency_list.cs"
-    [class]{Vertex}-[func]{}
-
     [class]{GraphAdjList}-[func]{}
     ```
 
 === "Swift"
 
     ```swift title="graph_adjacency_list.swift"
-    [class]{Vertex}-[func]{}
-
     [class]{GraphAdjList}-[func]{}
     ```
 
 === "Zig"
 
     ```zig title="graph_adjacency_list.zig"
-    [class]{Vertex}-[func]{}
-
     [class]{GraphAdjList}-[func]{}
     ```
 

docs/chapter_tree/binary_tree_traversal.md

@@ -18,7 +18,7 @@ comments: true
 
 <p align="center"> Fig. 二叉树的层序遍历 </p>
 
-### 实现代码
+### 算法实现
 
 广度优先遍历一般借助「队列」来实现。队列的规则是“先进先出”，广度优先遍历的规则是 ”一层层平推“ ，两者背后的思想是一致的。
 
@@ -108,7 +108,7 @@ comments: true
 
 </div>
 
-### 实现代码
+### 算法实现
 
 === "Java"