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/go/chapter_tree/binary_tree_dfs_test.go

@@ -0,0 +1,35 @@
+// File: binary_tree_dfs_test.go
+// Created Time: 2022-11-26
+// Author: Reanon (793584285@qq.com)
+
+package chapter_tree
+
+import (
+	"fmt"
+	"testing"
+
+	. "github.com/krahets/hello-algo/pkg"
+)
+
+func TestPreInPostOrderTraversal(t *testing.T) {
+	/* Initialize binary tree */
+	// Here we use a function to generate a binary tree directly from an array
+	root := SliceToTree([]any{1, 2, 3, 4, 5, 6, 7})
+	fmt.Println("\nInitialize binary tree: ")
+	PrintTree(root)
+
+	// Preorder traversal
+	nums = nil
+	preOrder(root)
+	fmt.Println("\nPre-order traversal node print sequence =", nums)
+
+	// Inorder traversal
+	nums = nil
+	inOrder(root)
+	fmt.Println("\nIn-order traversal node print sequence =", nums)
+
+	// Postorder traversal
+	nums = nil
+	postOrder(root)
+	fmt.Println("\nPost-order traversal node print sequence =", nums)
+}