Fix bugs and harmonize the code comments (#1199)

* Fix the comment in array_deque.go

* Fix the comment in bucket_sort.c

* Translate the Java code comments to Chinese

* Bug fixes

* 二分查找 -> 二分搜尋

* Harmonize comments in `utils` between multiple programming languages

codes/zig/include/TreeNode.zig

@@ -4,7 +4,7 @@
 
 const std = @import("std");
 
-// Definition for a binary tree node
+// 二叉树节点
 pub fn TreeNode(comptime T: type) type {
     return struct {
         const Self = @This();
@@ -24,7 +24,7 @@ pub fn TreeNode(comptime T: type) type {
     };   
 }
 
-// Generate a binary tree with an array
+// 将数组反序列化为二叉树
 pub fn arrToTree(comptime T: type, mem_allocator: std.mem.Allocator, arr: []T) !?*TreeNode(T) {
     if (arr.len == 0) return null;
     var root = try mem_allocator.create(TreeNode(T));