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-14 12:40: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,42 @@
+/**
+ * File: binary_tree_bfs.swift
+ * Created Time: 2023-01-18
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+import utils
+
+/* Level-order traversal */
+func levelOrder(root: TreeNode) -> [Int] {
+    // Initialize queue, add root node
+    var queue: [TreeNode] = [root]
+    // Initialize a list to save the traversal sequence
+    var list: [Int] = []
+    while !queue.isEmpty {
+        let node = queue.removeFirst() // Dequeue
+        list.append(node.val) // Save node value
+        if let left = node.left {
+            queue.append(left) // Left child node enqueue
+        }
+        if let right = node.right {
+            queue.append(right) // Right child node enqueue
+        }
+    }
+    return list
+}
+
+@main
+enum BinaryTreeBFS {
+    /* Driver Code */
+    static func main() {
+        /* Initialize binary tree */
+        // Here we use a function to generate a binary tree directly from an array
+        let node = TreeNode.listToTree(arr: [1, 2, 3, 4, 5, 6, 7])!
+        print("\nInitialize binary tree\n")
+        PrintUtil.printTree(root: node)
+
+        /* Level-order traversal */
+        let list = levelOrder(root: node)
+        print("\nLevel-order traversal node print sequence = \(list)")
+    }
+}