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/swift/chapter_tree/binary_tree.swift

@@ -0,0 +1,40 @@
+/**
+ * File: binary_tree.swift
+ * Created Time: 2023-01-18
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+import utils
+
+@main
+enum BinaryTree {
+    /* Driver Code */
+    static func main() {
+        /* Initialize binary tree */
+        // Initialize nodes
+        let n1 = TreeNode(x: 1)
+        let n2 = TreeNode(x: 2)
+        let n3 = TreeNode(x: 3)
+        let n4 = TreeNode(x: 4)
+        let n5 = TreeNode(x: 5)
+        // Build references (pointers) between nodes
+        n1.left = n2
+        n1.right = n3
+        n2.left = n4
+        n2.right = n5
+        print("\nInitialize binary tree\n")
+        PrintUtil.printTree(root: n1)
+
+        /* Insert node P between n1 -> n2 */
+        let P = TreeNode(x: 0)
+        // Delete node
+        n1.left = P
+        P.left = n2
+        print("\nAfter inserting node P\n")
+        PrintUtil.printTree(root: n1)
+        // Remove node P
+        n1.left = n2
+        print("\nAfter removing node P\n")
+        PrintUtil.printTree(root: n1)
+    }
+}