Sort the coding languages by applications. (#721)

docs/chapter_tree/binary_search_tree.md

@@ -33,9 +33,9 @@
 
 二叉搜索树的查找操作与二分查找算法的工作原理一致，都是每轮排除一半情况。循环次数最多为二叉树的高度，当二叉树平衡时，使用 $O(\log n)$ 时间。
 
-=== "Java"
+=== "Python"
 
-    ```java title="binary_search_tree.java"
+    ```python title="binary_search_tree.py"
     [class]{BinarySearchTree}-[func]{search}
     ```
 
@@ -45,9 +45,15 @@
     [class]{BinarySearchTree}-[func]{search}
     ```
 
-=== "Python"
+=== "Java"
 
-    ```python title="binary_search_tree.py"
+    ```java title="binary_search_tree.java"
+    [class]{BinarySearchTree}-[func]{search}
+    ```
+
+=== "C#"
+
+    ```csharp title="binary_search_tree.cs"
     [class]{BinarySearchTree}-[func]{search}
     ```
 
@@ -57,6 +63,12 @@
     [class]{binarySearchTree}-[func]{search}
     ```
 
+=== "Swift"
+
+    ```swift title="binary_search_tree.swift"
+    [class]{BinarySearchTree}-[func]{search}
+    ```
+
 === "JS"
 
     ```javascript title="binary_search_tree.js"
@@ -69,30 +81,6 @@
     [class]{BinarySearchTree}-[func]{search}
     ```
 
-=== "C"
-
-    ```c title="binary_search_tree.c"
-    [class]{binarySearchTree}-[func]{search}
-    ```
-
-=== "C#"
-
-    ```csharp title="binary_search_tree.cs"
-    [class]{BinarySearchTree}-[func]{search}
-    ```
-
-=== "Swift"
-
-    ```swift title="binary_search_tree.swift"
-    [class]{BinarySearchTree}-[func]{search}
-    ```
-
-=== "Zig"
-
-    ```zig title="binary_search_tree.zig"
-    [class]{BinarySearchTree}-[func]{search}
-    ```
-
 === "Dart"
 
     ```dart title="binary_search_tree.dart"
@@ -105,6 +93,18 @@
     [class]{BinarySearchTree}-[func]{search}
     ```
 
+=== "C"
+
+    ```c title="binary_search_tree.c"
+    [class]{binarySearchTree}-[func]{search}
+    ```
+
+=== "Zig"
+
+    ```zig title="binary_search_tree.zig"
+    [class]{BinarySearchTree}-[func]{search}
+    ```
+
 ### 插入节点
 
 给定一个待插入元素 `num` ，为了保持二叉搜索树“左子树 < 根节点 < 右子树”的性质，插入操作流程如下图所示。
@@ -119,9 +119,9 @@
 - 二叉搜索树不允许存在重复节点，否则将违反其定义。因此，若待插入节点在树中已存在，则不执行插入，直接返回。
 - 为了实现插入节点，我们需要借助节点 `pre` 保存上一轮循环的节点。这样在遍历至 $\text{None}$ 时，我们可以获取到其父节点，从而完成节点插入操作。
 
-=== "Java"
+=== "Python"
 
-    ```java title="binary_search_tree.java"
+    ```python title="binary_search_tree.py"
     [class]{BinarySearchTree}-[func]{insert}
     ```
 
@@ -131,9 +131,15 @@
     [class]{BinarySearchTree}-[func]{insert}
     ```
 
-=== "Python"
+=== "Java"
 
-    ```python title="binary_search_tree.py"
+    ```java title="binary_search_tree.java"
+    [class]{BinarySearchTree}-[func]{insert}
+    ```
+
+=== "C#"
+
+    ```csharp title="binary_search_tree.cs"
     [class]{BinarySearchTree}-[func]{insert}
     ```
 
@@ -143,6 +149,12 @@
     [class]{binarySearchTree}-[func]{insert}
     ```
 
+=== "Swift"
+
+    ```swift title="binary_search_tree.swift"
+    [class]{BinarySearchTree}-[func]{insert}
+    ```
+
 === "JS"
 
     ```javascript title="binary_search_tree.js"
@@ -155,30 +167,6 @@
     [class]{BinarySearchTree}-[func]{insert}
     ```
 
-=== "C"
-
-    ```c title="binary_search_tree.c"
-    [class]{binarySearchTree}-[func]{insert}
-    ```
-
-=== "C#"
-
-    ```csharp title="binary_search_tree.cs"
-    [class]{BinarySearchTree}-[func]{insert}
-    ```
-
-=== "Swift"
-
-    ```swift title="binary_search_tree.swift"
-    [class]{BinarySearchTree}-[func]{insert}
-    ```
-
-=== "Zig"
-
-    ```zig title="binary_search_tree.zig"
-    [class]{BinarySearchTree}-[func]{insert}
-    ```
-
 === "Dart"
 
     ```dart title="binary_search_tree.dart"
@@ -191,6 +179,18 @@
     [class]{BinarySearchTree}-[func]{insert}
     ```
 
+=== "C"
+
+    ```c title="binary_search_tree.c"
+    [class]{binarySearchTree}-[func]{insert}
+    ```
+
+=== "Zig"
+
+    ```zig title="binary_search_tree.zig"
+    [class]{BinarySearchTree}-[func]{insert}
+    ```
+
 与查找节点相同，插入节点使用 $O(\log n)$ 时间。
 
 ### 删除节点
@@ -230,9 +230,9 @@
 
 删除节点操作同样使用 $O(\log n)$ 时间，其中查找待删除节点需要 $O(\log n)$ 时间，获取中序遍历后继节点需要 $O(\log n)$ 时间。
 
-=== "Java"
+=== "Python"
 
-    ```java title="binary_search_tree.java"
+    ```python title="binary_search_tree.py"
     [class]{BinarySearchTree}-[func]{remove}
     ```
 
@@ -242,9 +242,15 @@
     [class]{BinarySearchTree}-[func]{remove}
     ```
 
-=== "Python"
+=== "Java"
 
-    ```python title="binary_search_tree.py"
+    ```java title="binary_search_tree.java"
+    [class]{BinarySearchTree}-[func]{remove}
+    ```
+
+=== "C#"
+
+    ```csharp title="binary_search_tree.cs"
     [class]{BinarySearchTree}-[func]{remove}
     ```
 
@@ -254,6 +260,12 @@
     [class]{binarySearchTree}-[func]{remove}
     ```
 
+=== "Swift"
+
+    ```swift title="binary_search_tree.swift"
+    [class]{BinarySearchTree}-[func]{remove}
+    ```
+
 === "JS"
 
     ```javascript title="binary_search_tree.js"
@@ -266,30 +278,6 @@
     [class]{BinarySearchTree}-[func]{remove}
     ```
 
-=== "C"
-
-    ```c title="binary_search_tree.c"
-    [class]{binarySearchTree}-[func]{removeNode}
-    ```
-
-=== "C#"
-
-    ```csharp title="binary_search_tree.cs"
-    [class]{BinarySearchTree}-[func]{remove}
-    ```
-
-=== "Swift"
-
-    ```swift title="binary_search_tree.swift"
-    [class]{BinarySearchTree}-[func]{remove}
-    ```
-
-=== "Zig"
-
-    ```zig title="binary_search_tree.zig"
-    [class]{BinarySearchTree}-[func]{remove}
-    ```
-
 === "Dart"
 
     ```dart title="binary_search_tree.dart"
@@ -302,6 +290,18 @@
     [class]{BinarySearchTree}-[func]{remove}
     ```
 
+=== "C"
+
+    ```c title="binary_search_tree.c"
+    [class]{binarySearchTree}-[func]{removeNode}
+    ```
+
+=== "Zig"
+
+    ```zig title="binary_search_tree.zig"
+    [class]{BinarySearchTree}-[func]{remove}
+    ```
+
 ### 中序遍历有序
 
 如下图所示，二叉树的中序遍历遵循“左 $\rightarrow$ 根 $\rightarrow$ 右”的遍历顺序，而二叉搜索树满足“左子节点 $<$ 根节点 $<$ 右子节点”的大小关系。