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/modules/ListNode.js

@@ -0,0 +1,31 @@
+/**
+ * File: ListNode.js
+ * Created Time: 2022-12-12
+ * Author: IsChristina (christinaxia77@foxmail.com)
+ */
+
+/* Linked list node */
+class ListNode {
+    val; // Node value
+    next; // Reference (pointer) to next node
+    constructor(val, next) {
+        this.val = val === undefined ? 0 : val;
+        this.next = next === undefined ? null : next;
+    }
+}
+
+/* Deserialize a list into a linked list */
+function arrToLinkedList(arr) {
+    const dum = new ListNode(0);
+    let head = dum;
+    for (const val of arr) {
+        head.next = new ListNode(val);
+        head = head.next;
+    }
+    return dum.next;
+}
+
+module.exports = {
+    ListNode,
+    arrToLinkedList,
+};

en/codes/javascript/modules/PrintUtil.js

@@ -0,0 +1,86 @@
+/**
+ * File: PrintUtil.js
+ * Created Time: 2022-12-04
+ * Author: IsChristina (christinaxia77@foxmail.com)
+ */
+
+const { arrToTree } = require('./TreeNode');
+
+/* Print linked list */
+function printLinkedList(head) {
+    let list = [];
+    while (head !== null) {
+        list.push(head.val.toString());
+        head = head.next;
+    }
+    console.log(list.join(' -> '));
+}
+
+function Trunk(prev, str) {
+    this.prev = prev;
+    this.str = str;
+}
+
+/**
+ * Print binary tree
+ * This tree printer is borrowed from TECHIE DELIGHT
+ * https://www.techiedelight.com/c-program-print-binary-tree/
+ */
+function printTree(root) {
+    printTree(root, null, false);
+}
+
+/* Print binary tree */
+function printTree(root, prev, isRight) {
+    if (root === null) {
+        return;
+    }
+
+    let prev_str = '    ';
+    let trunk = new Trunk(prev, prev_str);
+
+    printTree(root.right, trunk, true);
+
+    if (!prev) {
+        trunk.str = '———';
+    } else if (isRight) {
+        trunk.str = '/———';
+        prev_str = '   |';
+    } else {
+        trunk.str = '\\———';
+        prev.str = prev_str;
+    }
+
+    showTrunks(trunk);
+    console.log(' ' + root.val);
+
+    if (prev) {
+        prev.str = prev_str;
+    }
+    trunk.str = '   |';
+
+    printTree(root.left, trunk, false);
+}
+
+function showTrunks(p) {
+    if (!p) {
+        return;
+    }
+
+    showTrunks(p.prev);
+    process.stdout.write(p.str);
+}
+
+/* Print heap */
+function printHeap(arr) {
+    console.log('Heap array representation:');
+    console.log(arr);
+    console.log('Heap tree representation:');
+    printTree(arrToTree(arr));
+}
+
+module.exports = {
+    printLinkedList,
+    printTree,
+    printHeap,
+};

en/codes/javascript/modules/TreeNode.js

@@ -0,0 +1,35 @@
+/**
+ * File: TreeNode.js
+ * Created Time: 2022-12-04
+ * Author: IsChristina (christinaxia77@foxmail.com)
+ */
+
+/* Binary tree node */
+class TreeNode {
+    val; // Node value
+    left; // Left child pointer
+    right; // Right child pointer
+    height; // Node height
+    constructor(val, left, right, height) {
+        this.val = val === undefined ? 0 : val;
+        this.left = left === undefined ? null : left;
+        this.right = right === undefined ? null : right;
+        this.height = height === undefined ? 0 : height;
+    }
+}
+
+/* Deserialize array to binary tree */
+function arrToTree(arr, i = 0) {
+    if (i < 0 || i >= arr.length || arr[i] === null) {
+        return null;
+    }
+    let root = new TreeNode(arr[i]);
+    root.left = arrToTree(arr, 2 * i + 1);
+    root.right = arrToTree(arr, 2 * i + 2);
+    return root;
+}
+
+module.exports = {
+    TreeNode,
+    arrToTree,
+};

en/codes/javascript/modules/Vertex.js

@@ -0,0 +1,35 @@
+/**
+ * File: Vertex.js
+ * Created Time: 2023-02-15
+ * Author: Zhuo Qinyue (1403450829@qq.com)
+ */
+
+/* Vertex class */
+class Vertex {
+    val;
+    constructor(val) {
+        this.val = val;
+    }
+
+    /* Input value list vals, return vertex list vets */
+    static valsToVets(vals) {
+        const vets = [];
+        for (let i = 0; i < vals.length; i++) {
+            vets[i] = new Vertex(vals[i]);
+        }
+        return vets;
+    }
+
+    /* Input vertex list vets, return value list vals */
+    static vetsToVals(vets) {
+        const vals = [];
+        for (const vet of vets) {
+            vals.push(vet.val);
+        }
+        return vals;
+    }
+}
+
+module.exports = {
+    Vertex,
+};