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
2026-08-16 21:50:59 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,64 @@
+/**
+ * File: binary_tree_dfs.kt
+ * Created Time: 2024-01-25
+ * Author: curtishd (1023632660@qq.com)
+ */
+
+package chapter_tree
+
+import utils.TreeNode
+import utils.printTree
+
+// Initialize list for storing traversal sequence
+var list = mutableListOf<Int>()
+
+/* Preorder traversal */
+fun preOrder(root: TreeNode?) {
+    if (root == null) return
+    // Visit priority: root node -> left subtree -> right subtree
+    list.add(root._val)
+    preOrder(root.left)
+    preOrder(root.right)
+}
+
+/* Inorder traversal */
+fun inOrder(root: TreeNode?) {
+    if (root == null) return
+    // Visit priority: left subtree -> root node -> right subtree
+    inOrder(root.left)
+    list.add(root._val)
+    inOrder(root.right)
+}
+
+/* Postorder traversal */
+fun postOrder(root: TreeNode?) {
+    if (root == null) return
+    // Visit priority: left subtree -> right subtree -> root node
+    postOrder(root.left)
+    postOrder(root.right)
+    list.add(root._val)
+}
+
+/* Driver Code */
+fun main() {
+    /* Initialize binary tree */
+    // Here we use a function to generate binary tree directly from list
+    val root = TreeNode.listToTree(mutableListOf(1, 2, 3, 4, 5, 6, 7))
+    println("\nInitialize binary tree\n")
+    printTree(root)
+
+    /* Preorder traversal */
+    list.clear()
+    preOrder(root)
+    println("\nPre-order traversal node print sequence = $list")
+
+    /* Inorder traversal */
+    list.clear()
+    inOrder(root)
+    println("\nIn-order traversal node print sequence = $list")
+
+    /* Postorder traversal */
+    list.clear()
+    postOrder(root)
+    println("\nPost-order traversal node print sequence = $list")
+}