Fix a comment in binary_search_tree code

codes/c/chapter_tree/binary_search_tree.c

@@ -89,7 +89,7 @@ void insert(binarySearchTree *bst, int num) {
             cur = cur->left;
         }
     }
-    // 插入节点 val
+    // 插入节点
     TreeNode *node = newTreeNode(num);
     if (pre->val < num) {
         pre->right = node;

codes/cpp/chapter_tree/binary_search_tree.cpp

@@ -77,7 +77,7 @@ class BinarySearchTree {
             else
                 cur = cur->left;
         }
-        // 插入节点 val
+        // 插入节点
         TreeNode *node = new TreeNode(num);
         if (pre->val < num)
             pre->right = node;

codes/csharp/chapter_tree/binary_search_tree.cs

@@ -63,7 +63,7 @@ class BinarySearchTree {
             else cur = cur.left;
         }
 
-        // 插入节点 val
+        // 插入节点
         TreeNode node = new TreeNode(num);
         if (pre != null) {
             if (pre.val < num) pre.right = node;

codes/dart/chapter_tree/binary_search_tree.dart

@@ -70,7 +70,7 @@ void insert(int num) {
     else
       cur = cur.left;
   }
-  // 插入节点 val
+  // 插入节点
   TreeNode? node = TreeNode(num);
   if (pre!.val < num)
     pre.right = node;

codes/java/chapter_tree/binary_search_tree.java

@@ -74,7 +74,7 @@ class BinarySearchTree {
             else
                 cur = cur.left;
         }
-        // 插入节点 val
+        // 插入节点
         TreeNode node = new TreeNode(num);
         if (pre.val < num)
             pre.right = node;

codes/javascript/chapter_tree/binary_search_tree.js

@@ -66,7 +66,7 @@ function insert(num) {
         // 插入位置在 cur 的左子树中
         else cur = cur.left;
     }
-    // 插入节点 val
+    // 插入节点
     let node = new TreeNode(num);
     if (pre.val < num) pre.right = node;
     else pre.left = node;

codes/python/chapter_tree/binary_search_tree.py

@@ -77,7 +77,7 @@ class BinarySearchTree:
             else:
                 cur = cur.left
 
-        # 插入节点 val
+        # 插入节点
         node = TreeNode(num)
         if pre.val < num:
             pre.right = node

codes/swift/chapter_tree/binary_search_tree.swift

@@ -80,7 +80,7 @@ class BinarySearchTree {
                 cur = cur?.left
             }
         }
-        // 插入节点 val
+        // 插入节点
         let node = TreeNode(x: num)
         if pre!.val < num {
             pre?.right = node

codes/typescript/chapter_tree/binary_search_tree.ts

@@ -71,7 +71,7 @@ function insert(num: number): void {
             cur = cur.left as TreeNode; // 插入位置在 cur 的左子树中
         }
     }
-    // 插入节点 val
+    // 插入节点
     let node = new TreeNode(num);
     if (pre!.val < num) {
         pre!.right = node;

codes/zig/chapter_tree/binary_search_tree.zig

@@ -87,7 +87,7 @@ pub fn BinarySearchTree(comptime T: type) type {
                     cur = cur.?.left;
                 }
             }
-            // 插入节点 val
+            // 插入节点
             var node = try self.mem_allocator.create(inc.TreeNode(T));
             node.init(num);
             if (pre.?.val < num) {