Translate all code to English (#1836)

* Review the EN heading format.

* Fix pythontutor headings.

* Fix pythontutor headings.

* bug fixes

* Fix headings in **/summary.md

* Revisit the CN-to-EN translation for Python code using Claude-4.5

* Revisit the CN-to-EN translation for Java code using Claude-4.5

* Revisit the CN-to-EN translation for Cpp code using Claude-4.5.

* Fix the dictionary.

* Fix cpp code translation for the multipart strings.

* Translate Go code to English.

* Update workflows to test EN code.

* Add EN translation for C.

* Add EN translation for CSharp.

* Add EN translation for Swift.

* Trigger the CI check.

* Revert.

* Update en/hash_map.md

* Add the EN version of Dart code.

* Add the EN version of Kotlin code.

* Add missing code files.

* Add the EN version of JavaScript code.

* Add the EN version of TypeScript code.

* Fix the workflows.

* Add the EN version of Ruby code.

* Add the EN version of Rust code.

* Update the CI check for the English version  code.

* Update Python CI check.

* Fix cmakelists for en/C code.

* Fix Ruby comments

en/codes/javascript/chapter_divide_and_conquer/build_tree.js

@@ -0,0 +1,44 @@
+/**
+ * File: build_tree.js
+ * Created Time: 2023-07-30
+ * Author: yuan0221 (yl1452491917@gmail.com)
+ */
+
+const { printTree } = require('../modules/PrintUtil');
+const { TreeNode } = require('../modules/TreeNode');
+
+/* Build binary tree: divide and conquer */
+function dfs(preorder, inorderMap, i, l, r) {
+    // Terminate when the subtree interval is empty
+    if (r - l < 0) return null;
+    // Initialize the root node
+    const root = new TreeNode(preorder[i]);
+    // Query m to divide the left and right subtrees
+    const m = inorderMap.get(preorder[i]);
+    // Subproblem: build the left subtree
+    root.left = dfs(preorder, inorderMap, i + 1, l, m - 1);
+    // Subproblem: build the right subtree
+    root.right = dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r);
+    // Return the root node
+    return root;
+}
+
+/* Build binary tree */
+function buildTree(preorder, inorder) {
+    // Initialize hash map, storing the mapping from inorder elements to indices
+    let inorderMap = new Map();
+    for (let i = 0; i < inorder.length; i++) {
+        inorderMap.set(inorder[i], i);
+    }
+    const root = dfs(preorder, inorderMap, 0, 0, inorder.length - 1);
+    return root;
+}
+
+/* Driver Code */
+const preorder = [3, 9, 2, 1, 7];
+const inorder = [9, 3, 1, 2, 7];
+console.log('Preorder traversal = ' + JSON.stringify(preorder));
+console.log('Inorder traversal = ' + JSON.stringify(inorder));
+const root = buildTree(preorder, inorder);
+console.log('The constructed binary tree is:');
+printTree(root);