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-12 20:00:58 +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,70 @@
+/**
+ * File: binary_tree_dfs.swift
+ * Created Time: 2023-01-18
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+import utils
+
+// Initialize list for storing traversal sequence
+var list: [Int] = []
+
+/* Preorder traversal */
+func preOrder(root: TreeNode?) {
+    guard let root = root else {
+        return
+    }
+    // Visit priority: root node -> left subtree -> right subtree
+    list.append(root.val)
+    preOrder(root: root.left)
+    preOrder(root: root.right)
+}
+
+/* Inorder traversal */
+func inOrder(root: TreeNode?) {
+    guard let root = root else {
+        return
+    }
+    // Visit priority: left subtree -> root node -> right subtree
+    inOrder(root: root.left)
+    list.append(root.val)
+    inOrder(root: root.right)
+}
+
+/* Postorder traversal */
+func postOrder(root: TreeNode?) {
+    guard let root = root else {
+        return
+    }
+    // Visit priority: left subtree -> right subtree -> root node
+    postOrder(root: root.left)
+    postOrder(root: root.right)
+    list.append(root.val)
+}
+
+@main
+enum BinaryTreeDFS {
+    /* Driver Code */
+    static func main() {
+        /* Initialize binary tree */
+        // Here we use a function to generate a binary tree directly from an array
+        let root = TreeNode.listToTree(arr: [1, 2, 3, 4, 5, 6, 7])!
+        print("\nInitialize binary tree\n")
+        PrintUtil.printTree(root: root)
+
+        /* Preorder traversal */
+        list.removeAll()
+        preOrder(root: root)
+        print("\nPre-order traversal node print sequence = \(list)")
+
+        /* Inorder traversal */
+        list.removeAll()
+        inOrder(root: root)
+        print("\nIn-order traversal node print sequence = \(list)")
+
+        /* Postorder traversal */
+        list.removeAll()
+        postOrder(root: root)
+        print("\nPost-order traversal node print sequence = \(list)")
+    }
+}