Organizing all the code blocks.

docs/chapter_tree/binary_tree.md

@@ -8,7 +8,7 @@ comments: true
 
 === "Java"
 
-    ```java
+    ```java title=""
     /* 链表结点类 */
     class TreeNode {
         int val;         // 结点值
@@ -20,7 +20,7 @@ comments: true
 
 === "C++"
 
-    ```cpp
+    ```cpp title=""
     /* 链表结点结构体 */
     struct TreeNode {
         int val;          // 结点值
@@ -32,7 +32,7 @@ comments: true
 
 === "Python"
 
-    ```python
+    ```python title=""
     """ 链表结点类 """
     class TreeNode:
         def __init__(self, val=0, left=None, right=None):
@@ -43,7 +43,31 @@ comments: true
 
 === "Go"
 
-    ```go
+    ```go title=""
+
+    ```
+
+=== "JavaScript"
+
+    ```js title=""
+
+    ```
+
+=== "TypeScript"
+
+    ```typescript title=""
+
+    ```
+
+=== "C"
+
+    ```c title=""
+
+    ```
+
+=== "C#"
+
+    ```csharp title=""
 
     ```
 
@@ -142,6 +166,30 @@ comments: true
 
     ```
 
+=== "JavaScript"
+
+    ```js title="binary_tree.js"
+
+    ```
+
+=== "TypeScript"
+
+    ```typescript title="binary_tree.ts"
+
+    ```
+
+=== "C"
+
+    ```c title="binary_tree.c"
+
+    ```
+
+=== "C#"
+
+    ```csharp title="binary_tree.cs"
+
+    ```
+
 **插入与删除结点。** 与链表类似，插入与删除结点都可以通过修改指针实现。
 
 ![binary_tree_add_remove](binary_tree.assets/binary_tree_add_remove.png)
@@ -183,6 +231,30 @@ comments: true
 
     ```
 
+=== "JavaScript"
+
+    ```js title="binary_tree.js"
+
+    ```
+
+=== "TypeScript"
+
+    ```typescript title="binary_tree.ts"
+
+    ```
+
+=== "C"
+
+    ```c title="binary_tree.c"
+
+    ```
+
+=== "C#"
+
+    ```csharp title="binary_tree.cs"
+
+    ```
+
 !!! note
 
     插入结点会改变二叉树的原有逻辑结构，删除结点往往意味着删除了该结点的所有子树。因此，二叉树中的插入与删除一般都是由一套操作配合完成的，这样才能实现有意义的操作。
@@ -259,6 +331,30 @@ comments: true
 
     ```
 
+=== "JavaScript"
+
+    ```js title="binary_tree_bfs.js"
+
+    ```
+
+=== "TypeScript"
+
+    ```typescript title="binary_tree_bfs.ts"
+
+    ```
+
+=== "C"
+
+    ```c title="binary_tree_bfs.c"
+
+    ```
+
+=== "C#"
+
+    ```csharp title="binary_tree_bfs.cs"
+
+    ```
+
 ### 前序、中序、后序遍历
 
 相对地，前、中、后序遍历皆属于「深度优先遍历 Depth-First Traversal」，其体现着一种 “先走到尽头，再回头继续” 的回溯遍历方式。
@@ -353,6 +449,30 @@ comments: true
 
     ```
 
+=== "JavaScript"
+
+    ```js title="binary_tree_dfs.js"
+
+    ```
+
+=== "TypeScript"
+
+    ```typescript title="binary_tree_dfs.ts"
+
+    ```
+
+=== "C"
+
+    ```c title="binary_tree_dfs.c"
+
+    ```
+
+=== "C#"
+
+    ```csharp title="binary_tree_dfs.cs"
+
+    ```
+
 !!! note
 
     使用循环一样可以实现前、中、后序遍历，但代码相对繁琐，有兴趣的同学可以自行实现。